./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:32:53,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:32:53,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:32:53,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:32:53,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:32:53,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:32:53,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:32:53,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:32:53,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:32:53,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:32:53,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:32:53,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:32:53,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:32:53,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:32:53,981 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:32:53,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:32:53,982 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:32:53,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:32:53,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:32:53,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:32:53,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:32:53,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:32:53,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:32:53,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:32:53,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:32:53,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:32:53,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:32:53,986 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:32:53,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:32:53,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:32:53,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:32:53,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:32:53,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:32:53,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:32:53,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:32:53,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:32:53,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:32:53,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:32:53,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:32:53,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:32:53,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:32:53,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:32:53,994 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 [2024-10-11 09:32:54,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:32:54,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:32:54,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:32:54,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:32:54,230 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:32:54,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-10-11 09:32:55,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:32:55,763 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:32:55,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-10-11 09:32:55,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f8c863b26/414c964a690c499fabe6ed7ea4396dff/FLAGa002fdda0 [2024-10-11 09:32:55,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f8c863b26/414c964a690c499fabe6ed7ea4396dff [2024-10-11 09:32:55,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:32:55,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:32:55,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:32:55,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:32:55,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:32:55,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:32:55" (1/1) ... [2024-10-11 09:32:55,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173a9e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:55, skipping insertion in model container [2024-10-11 09:32:55,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:32:55" (1/1) ... [2024-10-11 09:32:55,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:32:55,944 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-10-11 09:32:56,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:32:56,029 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:32:56,063 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-10-11 09:32:56,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:32:56,128 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:32:56,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56 WrapperNode [2024-10-11 09:32:56,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:32:56,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:32:56,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:32:56,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:32:56,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,164 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,197 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-10-11 09:32:56,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:32:56,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:32:56,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:32:56,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:32:56,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,229 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:32:56,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,242 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,246 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:32:56,247 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:32:56,247 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:32:56,247 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:32:56,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (1/1) ... [2024-10-11 09:32:56,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:32:56,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:32:56,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:32:56,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:32:56,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:32:56,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:32:56,356 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:32:56,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:32:56,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:32:56,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:32:56,458 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:32:56,460 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:32:56,811 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 09:32:56,812 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:32:56,850 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:32:56,850 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:32:56,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:32:56 BoogieIcfgContainer [2024-10-11 09:32:56,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:32:56,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:32:56,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:32:56,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:32:56,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:32:55" (1/3) ... [2024-10-11 09:32:56,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118f661d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:32:56, skipping insertion in model container [2024-10-11 09:32:56,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:32:56" (2/3) ... [2024-10-11 09:32:56,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118f661d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:32:56, skipping insertion in model container [2024-10-11 09:32:56,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:32:56" (3/3) ... [2024-10-11 09:32:56,859 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-10-11 09:32:56,872 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:32:56,872 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:32:56,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:32:56,931 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2b4ec0ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:32:56,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:32:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 63 states have internal predecessors, (98), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 09:32:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 09:32:56,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:32:56,947 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:32:56,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:32:56,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:32:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash -839295184, now seen corresponding path program 1 times [2024-10-11 09:32:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:32:56,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368789933] [2024-10-11 09:32:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:32:56,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:32:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:32:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:32:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:32:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:32:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:32:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:32:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:32:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:32:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:32:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:32:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:32:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:32:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:32:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:32:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:32:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:32:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:32:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:32:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:32:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:32:57,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:32:57,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368789933] [2024-10-11 09:32:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368789933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:32:57,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:32:57,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:32:57,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606813889] [2024-10-11 09:32:57,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:32:57,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:32:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:32:57,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:32:57,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:32:57,351 INFO L87 Difference]: Start difference. First operand has 84 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 63 states have internal predecessors, (98), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 09:32:57,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:32:57,385 INFO L93 Difference]: Finished difference Result 160 states and 281 transitions. [2024-10-11 09:32:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:32:57,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 133 [2024-10-11 09:32:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:32:57,393 INFO L225 Difference]: With dead ends: 160 [2024-10-11 09:32:57,393 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 09:32:57,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:32:57,398 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:32:57,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:32:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 09:32:57,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 09:32:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 09:32:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-10-11 09:32:57,440 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 133 [2024-10-11 09:32:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:32:57,441 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-10-11 09:32:57,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 09:32:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-10-11 09:32:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 09:32:57,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:32:57,446 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:32:57,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:32:57,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:32:57,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:32:57,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1421339242, now seen corresponding path program 1 times [2024-10-11 09:32:57,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:32:57,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419365767] [2024-10-11 09:32:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:32:57,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:32:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:32:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:32:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:32:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:32:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:32:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:32:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:32:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:32:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:32:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:32:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:32:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:32:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:32:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:32:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:32:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:32:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:32:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:32:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:32:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:32:57,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:32:57,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419365767] [2024-10-11 09:32:57,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419365767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:32:57,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:32:57,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:32:57,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412946127] [2024-10-11 09:32:57,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:32:57,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:32:57,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:32:57,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:32:57,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:32:57,919 INFO L87 Difference]: Start difference. First operand 77 states and 120 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:32:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:32:58,368 INFO L93 Difference]: Finished difference Result 330 states and 506 transitions. [2024-10-11 09:32:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 09:32:58,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 133 [2024-10-11 09:32:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:32:58,371 INFO L225 Difference]: With dead ends: 330 [2024-10-11 09:32:58,371 INFO L226 Difference]: Without dead ends: 254 [2024-10-11 09:32:58,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:32:58,373 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 287 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:32:58,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 321 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:32:58,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-11 09:32:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 245. [2024-10-11 09:32:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 180 states have (on average 1.4388888888888889) internal successors, (259), 182 states have internal predecessors, (259), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 09:32:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 379 transitions. [2024-10-11 09:32:58,418 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 379 transitions. Word has length 133 [2024-10-11 09:32:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:32:58,418 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 379 transitions. [2024-10-11 09:32:58,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:32:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 379 transitions. [2024-10-11 09:32:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 09:32:58,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:32:58,420 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:32:58,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:32:58,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:32:58,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:32:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash 400270888, now seen corresponding path program 1 times [2024-10-11 09:32:58,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:32:58,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221620293] [2024-10-11 09:32:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:32:58,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:32:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:32:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:32:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:32:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:32:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:32:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:32:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:32:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:32:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:32:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:32:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:32:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:32:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:32:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:32:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:32:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:32:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:32:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:32:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:32:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:32:58,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:32:58,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221620293] [2024-10-11 09:32:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221620293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:32:58,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:32:58,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:32:58,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464029116] [2024-10-11 09:32:58,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:32:58,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:32:58,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:32:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:32:58,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:32:58,753 INFO L87 Difference]: Start difference. First operand 245 states and 379 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:32:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:32:59,052 INFO L93 Difference]: Finished difference Result 853 states and 1320 transitions. [2024-10-11 09:32:59,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:32:59,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 133 [2024-10-11 09:32:59,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:32:59,058 INFO L225 Difference]: With dead ends: 853 [2024-10-11 09:32:59,058 INFO L226 Difference]: Without dead ends: 609 [2024-10-11 09:32:59,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:32:59,060 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 260 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:32:59,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 285 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:32:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-10-11 09:32:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2024-10-11 09:32:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 444 states have (on average 1.4346846846846846) internal successors, (637), 449 states have internal predecessors, (637), 150 states have call successors, (150), 10 states have call predecessors, (150), 10 states have return successors, (150), 145 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-11 09:32:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 937 transitions. [2024-10-11 09:32:59,129 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 937 transitions. Word has length 133 [2024-10-11 09:32:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:32:59,131 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 937 transitions. [2024-10-11 09:32:59,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:32:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 937 transitions. [2024-10-11 09:32:59,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 09:32:59,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:32:59,136 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:32:59,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:32:59,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:32:59,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:32:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash -417377562, now seen corresponding path program 1 times [2024-10-11 09:32:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:32:59,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109377989] [2024-10-11 09:32:59,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:32:59,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:32:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:32:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:32:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:32:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:32:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:32:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:32:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:32:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:32:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:32:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:32:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:32:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:32:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:32:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:32:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:32:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:32:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:32:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:32:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:32:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:32:59,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:32:59,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109377989] [2024-10-11 09:32:59,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109377989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:32:59,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:32:59,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:32:59,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107980107] [2024-10-11 09:32:59,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:32:59,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:32:59,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:32:59,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:32:59,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:32:59,333 INFO L87 Difference]: Start difference. First operand 605 states and 937 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:32:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:32:59,645 INFO L93 Difference]: Finished difference Result 1400 states and 2164 transitions. [2024-10-11 09:32:59,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:32:59,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 133 [2024-10-11 09:32:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:32:59,651 INFO L225 Difference]: With dead ends: 1400 [2024-10-11 09:32:59,651 INFO L226 Difference]: Without dead ends: 794 [2024-10-11 09:32:59,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:32:59,653 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 211 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:32:59,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 521 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:32:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-10-11 09:32:59,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 790. [2024-10-11 09:32:59,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 576 states have (on average 1.4166666666666667) internal successors, (816), 582 states have internal predecessors, (816), 199 states have call successors, (199), 14 states have call predecessors, (199), 14 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2024-10-11 09:32:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1214 transitions. [2024-10-11 09:32:59,729 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1214 transitions. Word has length 133 [2024-10-11 09:32:59,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:32:59,730 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1214 transitions. [2024-10-11 09:32:59,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:32:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1214 transitions. [2024-10-11 09:32:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 09:32:59,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:32:59,732 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:32:59,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:32:59,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:32:59,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:32:59,733 INFO L85 PathProgramCache]: Analyzing trace with hash 469677286, now seen corresponding path program 1 times [2024-10-11 09:32:59,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:32:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607754602] [2024-10-11 09:32:59,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:32:59,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:32:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:32:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:32:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:32:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:32:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:32:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:32:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:32:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:32:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:32:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:32:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:32:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:32:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:32:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:32:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:32:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:32:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:32:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:32:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:32:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:32:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:32:59,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:32:59,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607754602] [2024-10-11 09:32:59,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607754602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:32:59,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:32:59,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:32:59,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159060032] [2024-10-11 09:32:59,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:32:59,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:32:59,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:32:59,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:32:59,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:32:59,964 INFO L87 Difference]: Start difference. First operand 790 states and 1214 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:00,214 INFO L93 Difference]: Finished difference Result 1512 states and 2313 transitions. [2024-10-11 09:33:00,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:33:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 133 [2024-10-11 09:33:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:00,219 INFO L225 Difference]: With dead ends: 1512 [2024-10-11 09:33:00,219 INFO L226 Difference]: Without dead ends: 850 [2024-10-11 09:33:00,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:33:00,221 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 241 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:00,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 214 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:33:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-10-11 09:33:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 673. [2024-10-11 09:33:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 491 states have (on average 1.415478615071283) internal successors, (695), 496 states have internal predecessors, (695), 169 states have call successors, (169), 12 states have call predecessors, (169), 12 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2024-10-11 09:33:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1033 transitions. [2024-10-11 09:33:00,300 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1033 transitions. Word has length 133 [2024-10-11 09:33:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:00,300 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1033 transitions. [2024-10-11 09:33:00,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1033 transitions. [2024-10-11 09:33:00,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 09:33:00,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:00,302 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:33:00,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:33:00,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:00,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash -551391068, now seen corresponding path program 1 times [2024-10-11 09:33:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501511542] [2024-10-11 09:33:00,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:33:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:33:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:33:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:33:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:33:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:33:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:33:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:33:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:33:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:33:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:33:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:33:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:33:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:33:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:33:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:33:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:33:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:33:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:33:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:33:00,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:33:00,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501511542] [2024-10-11 09:33:00,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501511542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:33:00,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:33:00,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:33:00,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124532893] [2024-10-11 09:33:00,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:33:00,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:33:00,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:33:00,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:33:00,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:33:00,672 INFO L87 Difference]: Start difference. First operand 673 states and 1033 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:01,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:01,009 INFO L93 Difference]: Finished difference Result 1465 states and 2244 transitions. [2024-10-11 09:33:01,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:33:01,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 133 [2024-10-11 09:33:01,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:01,014 INFO L225 Difference]: With dead ends: 1465 [2024-10-11 09:33:01,014 INFO L226 Difference]: Without dead ends: 793 [2024-10-11 09:33:01,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:33:01,021 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 337 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:01,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 398 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:33:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2024-10-11 09:33:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 673. [2024-10-11 09:33:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 491 states have (on average 1.4134419551934827) internal successors, (694), 496 states have internal predecessors, (694), 169 states have call successors, (169), 12 states have call predecessors, (169), 12 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2024-10-11 09:33:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1032 transitions. [2024-10-11 09:33:01,082 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1032 transitions. Word has length 133 [2024-10-11 09:33:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:01,082 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1032 transitions. [2024-10-11 09:33:01,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1032 transitions. [2024-10-11 09:33:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 09:33:01,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:01,084 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:33:01,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:33:01,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:01,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash 934223843, now seen corresponding path program 1 times [2024-10-11 09:33:01,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:01,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495024249] [2024-10-11 09:33:01,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:01,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:33:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:33:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:33:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:33:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:33:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:33:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:33:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:33:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:33:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:33:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:33:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:33:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:33:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:33:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:33:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:33:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:33:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:33:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:33:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:33:01,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:33:01,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495024249] [2024-10-11 09:33:01,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495024249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:33:01,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:33:01,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:33:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921263486] [2024-10-11 09:33:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:33:01,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:33:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:33:01,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:33:01,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:33:01,228 INFO L87 Difference]: Start difference. First operand 673 states and 1032 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:01,520 INFO L93 Difference]: Finished difference Result 1491 states and 2282 transitions. [2024-10-11 09:33:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:33:01,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 134 [2024-10-11 09:33:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:01,525 INFO L225 Difference]: With dead ends: 1491 [2024-10-11 09:33:01,525 INFO L226 Difference]: Without dead ends: 819 [2024-10-11 09:33:01,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:33:01,527 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 225 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:01,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 351 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:33:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-10-11 09:33:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 806. [2024-10-11 09:33:01,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 582 states have (on average 1.402061855670103) internal successors, (816), 588 states have internal predecessors, (816), 207 states have call successors, (207), 16 states have call predecessors, (207), 16 states have return successors, (207), 201 states have call predecessors, (207), 207 states have call successors, (207) [2024-10-11 09:33:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1230 transitions. [2024-10-11 09:33:01,591 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1230 transitions. Word has length 134 [2024-10-11 09:33:01,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:01,591 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1230 transitions. [2024-10-11 09:33:01,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1230 transitions. [2024-10-11 09:33:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 09:33:01,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:01,592 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:33:01,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 09:33:01,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:01,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1074772453, now seen corresponding path program 1 times [2024-10-11 09:33:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:01,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063527471] [2024-10-11 09:33:01,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:01,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:33:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:33:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:33:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:33:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:33:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:33:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:33:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:33:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:33:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:33:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:33:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:33:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:33:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:33:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:33:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:33:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:33:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:33:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:33:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:33:01,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:33:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063527471] [2024-10-11 09:33:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063527471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:33:01,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:33:01,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:33:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048932282] [2024-10-11 09:33:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:33:01,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:33:01,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:33:01,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:33:01,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:33:01,672 INFO L87 Difference]: Start difference. First operand 806 states and 1230 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:01,779 INFO L93 Difference]: Finished difference Result 1446 states and 2206 transitions. [2024-10-11 09:33:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:33:01,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 134 [2024-10-11 09:33:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:01,784 INFO L225 Difference]: With dead ends: 1446 [2024-10-11 09:33:01,784 INFO L226 Difference]: Without dead ends: 758 [2024-10-11 09:33:01,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:33:01,786 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 110 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:01,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 234 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:33:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-10-11 09:33:01,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 756. [2024-10-11 09:33:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 542 states have (on average 1.3874538745387455) internal successors, (752), 548 states have internal predecessors, (752), 199 states have call successors, (199), 14 states have call predecessors, (199), 14 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2024-10-11 09:33:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1150 transitions. [2024-10-11 09:33:01,842 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1150 transitions. Word has length 134 [2024-10-11 09:33:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:01,842 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1150 transitions. [2024-10-11 09:33:01,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1150 transitions. [2024-10-11 09:33:01,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 09:33:01,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:01,843 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:33:01,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 09:33:01,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:01,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:01,844 INFO L85 PathProgramCache]: Analyzing trace with hash 813050468, now seen corresponding path program 1 times [2024-10-11 09:33:01,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:01,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532150522] [2024-10-11 09:33:01,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:01,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:33:01,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371427938] [2024-10-11 09:33:01,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:01,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:01,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:33:01,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:33:01,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:33:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:01,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 09:33:01,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:33:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:33:02,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:33:02,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:33:02,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532150522] [2024-10-11 09:33:02,471 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:33:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371427938] [2024-10-11 09:33:02,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371427938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:33:02,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:33:02,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 09:33:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530219863] [2024-10-11 09:33:02,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:33:02,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:33:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:33:02,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:33:02,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:33:02,474 INFO L87 Difference]: Start difference. First operand 756 states and 1150 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:03,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:03,138 INFO L93 Difference]: Finished difference Result 3246 states and 4939 transitions. [2024-10-11 09:33:03,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:33:03,139 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2024-10-11 09:33:03,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:03,150 INFO L225 Difference]: With dead ends: 3246 [2024-10-11 09:33:03,150 INFO L226 Difference]: Without dead ends: 2491 [2024-10-11 09:33:03,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:33:03,153 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 381 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:03,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 649 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:33:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2024-10-11 09:33:03,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 1733. [2024-10-11 09:33:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1243 states have (on average 1.3732904263877714) internal successors, (1707), 1255 states have internal predecessors, (1707), 455 states have call successors, (455), 34 states have call predecessors, (455), 34 states have return successors, (455), 443 states have call predecessors, (455), 455 states have call successors, (455) [2024-10-11 09:33:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2617 transitions. [2024-10-11 09:33:03,322 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2617 transitions. Word has length 135 [2024-10-11 09:33:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:03,323 INFO L471 AbstractCegarLoop]: Abstraction has 1733 states and 2617 transitions. [2024-10-11 09:33:03,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2617 transitions. [2024-10-11 09:33:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 09:33:03,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:03,324 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:33:03,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:33:03,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:03,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:03,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash 420023458, now seen corresponding path program 1 times [2024-10-11 09:33:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:03,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878246066] [2024-10-11 09:33:03,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:03,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:33:03,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527040784] [2024-10-11 09:33:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:03,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:03,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:33:03,559 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:33:03,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:33:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:03,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:33:03,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:33:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:33:03,829 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:33:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:33:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878246066] [2024-10-11 09:33:03,829 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:33:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527040784] [2024-10-11 09:33:03,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527040784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:33:03,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:33:03,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 09:33:03,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359561387] [2024-10-11 09:33:03,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:33:03,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:33:03,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:33:03,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:33:03,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:33:03,830 INFO L87 Difference]: Start difference. First operand 1733 states and 2617 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:04,828 INFO L93 Difference]: Finished difference Result 7589 states and 11508 transitions. [2024-10-11 09:33:04,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 09:33:04,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 135 [2024-10-11 09:33:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:04,855 INFO L225 Difference]: With dead ends: 7589 [2024-10-11 09:33:04,855 INFO L226 Difference]: Without dead ends: 5857 [2024-10-11 09:33:04,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:33:04,861 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 308 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:04,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1240 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 09:33:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5857 states. [2024-10-11 09:33:05,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5857 to 4657. [2024-10-11 09:33:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4657 states, 3273 states have (on average 1.3486098380690499) internal successors, (4414), 3309 states have internal predecessors, (4414), 1289 states have call successors, (1289), 94 states have call predecessors, (1289), 94 states have return successors, (1289), 1253 states have call predecessors, (1289), 1289 states have call successors, (1289) [2024-10-11 09:33:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 6992 transitions. [2024-10-11 09:33:05,712 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 6992 transitions. Word has length 135 [2024-10-11 09:33:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:05,712 INFO L471 AbstractCegarLoop]: Abstraction has 4657 states and 6992 transitions. [2024-10-11 09:33:05,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 6992 transitions. [2024-10-11 09:33:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:33:05,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:05,716 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:33:05,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:33:05,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:05,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:05,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:05,918 INFO L85 PathProgramCache]: Analyzing trace with hash -691956318, now seen corresponding path program 1 times [2024-10-11 09:33:05,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:05,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806391780] [2024-10-11 09:33:05,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:05,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:33:05,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396582437] [2024-10-11 09:33:05,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:05,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:05,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:33:05,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:33:05,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:33:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:06,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 09:33:06,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:33:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:33:06,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:33:06,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:33:06,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806391780] [2024-10-11 09:33:06,470 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:33:06,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396582437] [2024-10-11 09:33:06,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396582437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:33:06,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:33:06,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 09:33:06,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510298798] [2024-10-11 09:33:06,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:33:06,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:33:06,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:33:06,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:33:06,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:33:06,472 INFO L87 Difference]: Start difference. First operand 4657 states and 6992 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:07,419 INFO L93 Difference]: Finished difference Result 5616 states and 8431 transitions. [2024-10-11 09:33:07,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 09:33:07,420 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 136 [2024-10-11 09:33:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:07,479 INFO L225 Difference]: With dead ends: 5616 [2024-10-11 09:33:07,479 INFO L226 Difference]: Without dead ends: 4978 [2024-10-11 09:33:07,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-10-11 09:33:07,482 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 437 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:07,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 975 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 09:33:07,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2024-10-11 09:33:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 4669. [2024-10-11 09:33:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4669 states, 3285 states have (on average 1.349771689497717) internal successors, (4434), 3321 states have internal predecessors, (4434), 1289 states have call successors, (1289), 94 states have call predecessors, (1289), 94 states have return successors, (1289), 1253 states have call predecessors, (1289), 1289 states have call successors, (1289) [2024-10-11 09:33:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4669 states to 4669 states and 7012 transitions. [2024-10-11 09:33:08,000 INFO L78 Accepts]: Start accepts. Automaton has 4669 states and 7012 transitions. Word has length 136 [2024-10-11 09:33:08,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:08,000 INFO L471 AbstractCegarLoop]: Abstraction has 4669 states and 7012 transitions. [2024-10-11 09:33:08,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 4669 states and 7012 transitions. [2024-10-11 09:33:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:33:08,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:08,003 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:33:08,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 09:33:08,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:08,203 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:08,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash -689554809, now seen corresponding path program 1 times [2024-10-11 09:33:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:08,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149486780] [2024-10-11 09:33:08,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:33:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:33:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:33:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:33:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:33:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:33:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:33:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:33:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:33:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:33:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:33:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:33:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:33:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:33:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:33:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:33:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:33:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:33:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:33:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:33:08,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:33:08,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149486780] [2024-10-11 09:33:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149486780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:33:08,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:33:08,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:33:08,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640974288] [2024-10-11 09:33:08,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:33:08,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:33:08,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:33:08,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:33:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:33:08,320 INFO L87 Difference]: Start difference. First operand 4669 states and 7012 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:09,003 INFO L93 Difference]: Finished difference Result 11242 states and 16820 transitions. [2024-10-11 09:33:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:33:09,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 136 [2024-10-11 09:33:09,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:09,067 INFO L225 Difference]: With dead ends: 11242 [2024-10-11 09:33:09,068 INFO L226 Difference]: Without dead ends: 6574 [2024-10-11 09:33:09,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:33:09,092 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 37 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:09,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 215 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:33:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6574 states. [2024-10-11 09:33:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6574 to 5825. [2024-10-11 09:33:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5825 states, 4441 states have (on average 1.3731141634766943) internal successors, (6098), 4477 states have internal predecessors, (6098), 1289 states have call successors, (1289), 94 states have call predecessors, (1289), 94 states have return successors, (1289), 1253 states have call predecessors, (1289), 1289 states have call successors, (1289) [2024-10-11 09:33:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 8676 transitions. [2024-10-11 09:33:09,566 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 8676 transitions. Word has length 136 [2024-10-11 09:33:09,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:09,566 INFO L471 AbstractCegarLoop]: Abstraction has 5825 states and 8676 transitions. [2024-10-11 09:33:09,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 8676 transitions. [2024-10-11 09:33:09,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:33:09,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:09,570 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:33:09,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 09:33:09,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:09,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:09,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1498901435, now seen corresponding path program 1 times [2024-10-11 09:33:09,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:33:09,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105797107] [2024-10-11 09:33:09,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:09,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:33:09,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:33:09,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [144028477] [2024-10-11 09:33:09,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:09,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:33:09,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:33:09,607 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:33:09,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 09:33:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:33:09,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:33:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:33:09,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:33:09,825 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:33:09,826 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:33:09,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 09:33:10,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 09:33:10,037 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:33:10,121 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:33:10,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:33:10 BoogieIcfgContainer [2024-10-11 09:33:10,123 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:33:10,124 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:33:10,124 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:33:10,124 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:33:10,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:32:56" (3/4) ... [2024-10-11 09:33:10,126 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:33:10,127 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:33:10,127 INFO L158 Benchmark]: Toolchain (without parser) took 14333.76ms. Allocated memory was 182.5MB in the beginning and 815.8MB in the end (delta: 633.3MB). Free memory was 114.9MB in the beginning and 609.6MB in the end (delta: -494.8MB). Peak memory consumption was 141.4MB. Max. memory is 16.1GB. [2024-10-11 09:33:10,127 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 104.9MB. Free memory was 72.8MB in the beginning and 72.7MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:33:10,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.77ms. Allocated memory is still 182.5MB. Free memory was 114.7MB in the beginning and 152.0MB in the end (delta: -37.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-10-11 09:33:10,128 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.45ms. Allocated memory is still 182.5MB. Free memory was 152.0MB in the beginning and 147.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 09:33:10,128 INFO L158 Benchmark]: Boogie Preprocessor took 48.54ms. Allocated memory is still 182.5MB. Free memory was 147.2MB in the beginning and 142.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:33:10,128 INFO L158 Benchmark]: RCFGBuilder took 603.39ms. Allocated memory is still 182.5MB. Free memory was 142.3MB in the beginning and 112.3MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 09:33:10,128 INFO L158 Benchmark]: TraceAbstraction took 13270.85ms. Allocated memory was 182.5MB in the beginning and 815.8MB in the end (delta: 633.3MB). Free memory was 111.5MB in the beginning and 610.7MB in the end (delta: -499.1MB). Peak memory consumption was 134.9MB. Max. memory is 16.1GB. [2024-10-11 09:33:10,128 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 815.8MB. Free memory was 610.7MB in the beginning and 609.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 09:33:10,129 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 104.9MB. Free memory was 72.8MB in the beginning and 72.7MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.77ms. Allocated memory is still 182.5MB. Free memory was 114.7MB in the beginning and 152.0MB in the end (delta: -37.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.45ms. Allocated memory is still 182.5MB. Free memory was 152.0MB in the beginning and 147.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.54ms. Allocated memory is still 182.5MB. Free memory was 147.2MB in the beginning and 142.3MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 603.39ms. Allocated memory is still 182.5MB. Free memory was 142.3MB in the beginning and 112.3MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13270.85ms. Allocated memory was 182.5MB in the beginning and 815.8MB in the end (delta: 633.3MB). Free memory was 111.5MB in the beginning and 610.7MB in the end (delta: -499.1MB). Peak memory consumption was 134.9MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 815.8MB. Free memory was 610.7MB in the beginning and 609.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 180. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed long int var_1_11 = 4; [L31] unsigned short int var_1_14 = 10000; [L32] unsigned short int var_1_16 = 5; [L33] unsigned short int var_1_17 = 4; [L34] unsigned char var_1_18 = 100; [L35] unsigned char var_1_19 = 1; [L36] unsigned char var_1_20 = 8; [L37] double var_1_21 = 63.25; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_25 = 0; [L40] unsigned char var_1_26 = 0; [L41] signed long int var_1_27 = 0; [L42] signed short int var_1_29 = 2; [L43] unsigned char var_1_31 = 1; [L44] signed long int var_1_32 = 32; [L45] signed long int var_1_34 = 0; [L46] unsigned char var_1_37 = 1; [L47] unsigned long int var_1_38 = 16; [L48] unsigned char var_1_39 = 0; [L49] unsigned char var_1_40 = 0; [L50] double last_1_var_1_1 = 256.5; [L51] float last_1_var_1_8 = 5.25; [L52] signed long int last_1_var_1_11 = 4; [L53] unsigned short int last_1_var_1_14 = 10000; [L54] unsigned short int last_1_var_1_17 = 4; [L55] unsigned char last_1_var_1_18 = 100; [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_11 = var_1_11 [L175] last_1_var_1_14 = var_1_14 [L176] last_1_var_1_17 = var_1_17 [L177] last_1_var_1_18 = var_1_18 [L187] RET updateLastVariables() [L188] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L143] var_1_3 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L144] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L145] var_1_4 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L146] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L147] var_1_5 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L148] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L152] var_1_16 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L153] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L155] var_1_19 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L156] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L158] var_1_20 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L159] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L161] var_1_25 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L162] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L164] var_1_26 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L165] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L167] var_1_40 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L168] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L188] RET updateVariables() [L189] CALL step() [L59] COND FALSE !(\read(var_1_2)) [L68] var_1_17 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L70] COND TRUE var_1_17 == var_1_18 [L71] var_1_31 = (! var_1_26) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L73] COND TRUE var_1_16 < var_1_11 [L74] var_1_34 = var_1_16 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] EXPR var_1_18 & var_1_17 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] EXPR (var_1_18 & var_1_17) & var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] COND TRUE ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) <= ((var_1_18 & var_1_17) & var_1_18) [L85] var_1_38 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L87] COND TRUE ! var_1_2 [L88] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L92] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L97] var_1_27 = var_1_17 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L98] COND TRUE var_1_20 < var_1_17 [L99] var_1_39 = (! (var_1_26 && var_1_40)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L101] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L102] EXPR var_1_6 | var_1_6 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L102] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > stepLocal_1) [L105] var_1_29 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L106] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L113] COND TRUE var_1_4 <= last_1_var_1_1 [L114] var_1_11 = (last_1_var_1_14 + -128) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L118] var_1_21 = var_1_5 [L119] var_1_37 = (var_1_2 && var_1_25) [L120] signed long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_0=9872, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L121] COND TRUE (var_1_14 * var_1_17) >= stepLocal_0 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L122] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L126] COND FALSE !(var_1_4 < (- var_1_5)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L133] COND FALSE !(var_1_20 < ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L189] RET step() [L190] CALL, EXPR property() [L180] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L180-L181] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 13, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2834 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2834 mSDsluCounter, 5520 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3585 mSDsCounter, 560 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3113 IncrementalHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 560 mSolverCounterUnsat, 1935 mSDtfsCounter, 3113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 828 GetRequests, 774 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5825occurred in iteration=12, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 3345 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2286 NumberOfCodeBlocks, 2286 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1596 ConstructedInterpolants, 0 QuantifiedInterpolants, 5427 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1053 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 8208/8208 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 09:33:10,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:33:12,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:33:12,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:33:12,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:33:12,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:33:12,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:33:12,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:33:12,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:33:12,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:33:12,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:33:12,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:33:12,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:33:12,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:33:12,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:33:12,917 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:33:12,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:33:12,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:33:12,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:33:12,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:33:12,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:33:12,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:33:12,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:33:12,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:33:12,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:33:12,922 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:33:12,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:33:12,923 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:33:12,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:33:12,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:33:12,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:33:12,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:33:12,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:33:12,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:33:12,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:33:12,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:33:12,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:33:12,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:33:12,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:33:12,932 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:33:12,932 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:33:12,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:33:12,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:33:12,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:33:12,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:33:12,934 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:33:12,935 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 [2024-10-11 09:33:13,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:33:13,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:33:13,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:33:13,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:33:13,226 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:33:13,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-10-11 09:33:14,669 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:33:14,887 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:33:14,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-10-11 09:33:14,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c33e528cb/f6b4437310ef4a15933da3136dfa3243/FLAG1ce6a9a99 [2024-10-11 09:33:14,915 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c33e528cb/f6b4437310ef4a15933da3136dfa3243 [2024-10-11 09:33:14,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:33:14,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:33:14,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:33:14,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:33:14,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:33:14,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:33:14" (1/1) ... [2024-10-11 09:33:14,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19483055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:14, skipping insertion in model container [2024-10-11 09:33:14,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:33:14" (1/1) ... [2024-10-11 09:33:14,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:33:15,091 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-10-11 09:33:15,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:33:15,158 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:33:15,167 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i[919,932] [2024-10-11 09:33:15,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:33:15,215 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:33:15,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15 WrapperNode [2024-10-11 09:33:15,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:33:15,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:33:15,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:33:15,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:33:15,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,269 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-10-11 09:33:15,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:33:15,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:33:15,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:33:15,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:33:15,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,311 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:33:15,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:33:15,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:33:15,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:33:15,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:33:15,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (1/1) ... [2024-10-11 09:33:15,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:33:15,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:33:15,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:33:15,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:33:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:33:15,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:33:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:33:15,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:33:15,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:33:15,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:33:15,569 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:33:15,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:33:28,717 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 09:33:28,717 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:33:28,764 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:33:28,764 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:33:28,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:33:28 BoogieIcfgContainer [2024-10-11 09:33:28,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:33:28,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:33:28,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:33:28,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:33:28,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:33:14" (1/3) ... [2024-10-11 09:33:28,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e69513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:33:28, skipping insertion in model container [2024-10-11 09:33:28,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:33:15" (2/3) ... [2024-10-11 09:33:28,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e69513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:33:28, skipping insertion in model container [2024-10-11 09:33:28,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:33:28" (3/3) ... [2024-10-11 09:33:28,791 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-10-11 09:33:28,821 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:33:28,821 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:33:28,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:33:28,947 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@781152a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:33:28,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:33:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 47 states have (on average 1.574468085106383) internal successors, (74), 48 states have internal predecessors, (74), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 09:33:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 09:33:28,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:28,978 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:33:28,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:28,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2107664818, now seen corresponding path program 1 times [2024-10-11 09:33:29,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:33:29,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076310621] [2024-10-11 09:33:29,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:29,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:33:29,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:33:29,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:33:29,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 09:33:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:29,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:33:29,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:33:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:33:32,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:33:32,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:33:32,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076310621] [2024-10-11 09:33:32,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076310621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:33:32,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:33:32,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:33:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613399557] [2024-10-11 09:33:32,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:33:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:33:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:33:32,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:33:32,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:33:32,633 INFO L87 Difference]: Start difference. First operand has 69 states, 47 states have (on average 1.574468085106383) internal successors, (74), 48 states have internal predecessors, (74), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:37,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:33:41,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:33:45,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:33:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:33:45,193 INFO L93 Difference]: Finished difference Result 199 states and 366 transitions. [2024-10-11 09:33:45,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:33:45,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 128 [2024-10-11 09:33:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:33:45,213 INFO L225 Difference]: With dead ends: 199 [2024-10-11 09:33:45,214 INFO L226 Difference]: Without dead ends: 131 [2024-10-11 09:33:45,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:33:45,224 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 39 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:33:45,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 198 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2024-10-11 09:33:45,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-11 09:33:45,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-10-11 09:33:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 88 states have (on average 1.4659090909090908) internal successors, (129), 88 states have internal predecessors, (129), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 09:33:45,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 205 transitions. [2024-10-11 09:33:45,317 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 205 transitions. Word has length 128 [2024-10-11 09:33:45,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:33:45,320 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 205 transitions. [2024-10-11 09:33:45,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:33:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 205 transitions. [2024-10-11 09:33:45,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 09:33:45,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:33:45,328 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:33:45,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 09:33:45,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:33:45,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:33:45,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:33:45,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1486237900, now seen corresponding path program 1 times [2024-10-11 09:33:45,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:33:45,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939495539] [2024-10-11 09:33:45,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:33:45,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:33:45,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:33:45,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:33:45,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 09:33:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:33:46,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:33:46,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:33:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 09:33:55,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:33:55,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:33:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939495539] [2024-10-11 09:33:55,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939495539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:33:55,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:33:55,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 09:33:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361510484] [2024-10-11 09:33:55,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:33:55,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:33:55,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:33:55,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:33:55,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:33:55,620 INFO L87 Difference]: Start difference. First operand 129 states and 205 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-11 09:34:04,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:34:08,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:34:12,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:34:16,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:34:20,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:34:24,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:34:28,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []