./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_codestructure_dependencies_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a85c63270a82c8ef0a288aa71699029145198375482b0774861abf1408115eb1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:17:37,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:17:37,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:17:37,332 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:17:37,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:17:37,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:17:37,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:17:37,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:17:37,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:17:37,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:17:37,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:17:37,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:17:37,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:17:37,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:17:37,372 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:17:37,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:17:37,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:17:37,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:17:37,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:17:37,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:17:37,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:17:37,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:17:37,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:17:37,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:17:37,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:17:37,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:17:37,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:17:37,375 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:17:37,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:17:37,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:17:37,376 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:17:37,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:17:37,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:17:37,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:17:37,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:17:37,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:17:37,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:17:37,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:17:37,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:17:37,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:17:37,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:17:37,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:17:37,381 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/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/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 -> a85c63270a82c8ef0a288aa71699029145198375482b0774861abf1408115eb1 [2024-10-14 07:17:37,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:17:37,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:17:37,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:17:37,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:17:37,656 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:17:37,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-42.i [2024-10-14 07:17:39,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:17:39,310 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:17:39,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-42.i [2024-10-14 07:17:39,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e95d7cf0f/4fb1244e8c784fb68754423a25626204/FLAGfe27375bc [2024-10-14 07:17:39,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e95d7cf0f/4fb1244e8c784fb68754423a25626204 [2024-10-14 07:17:39,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:17:39,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:17:39,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:17:39,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:17:39,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:17:39,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:39,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42409ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39, skipping insertion in model container [2024-10-14 07:17:39,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:39,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:17:39,863 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_codestructure_dependencies_file-42.i[919,932] [2024-10-14 07:17:39,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:17:39,931 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:17:39,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_codestructure_dependencies_file-42.i[919,932] [2024-10-14 07:17:39,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:17:39,989 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:17:39,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39 WrapperNode [2024-10-14 07:17:39,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:17:39,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:17:40,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:17:40,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:17:40,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,102 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-10-14 07:17:40,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:17:40,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:17:40,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:17:40,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:17:40,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,142 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-14 07:17:40,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,159 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:17:40,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:17:40,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:17:40,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:17:40,178 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (1/1) ... [2024-10-14 07:17:40,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:17:40,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:17:40,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:17:40,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:17:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:17:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:17:40,259 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:17:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:17:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:17:40,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:17:40,336 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:17:40,338 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:17:40,610 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 07:17:40,611 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:17:40,663 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:17:40,663 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:17:40,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:17:40 BoogieIcfgContainer [2024-10-14 07:17:40,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:17:40,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:17:40,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:17:40,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:17:40,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:17:39" (1/3) ... [2024-10-14 07:17:40,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1b19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:17:40, skipping insertion in model container [2024-10-14 07:17:40,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:39" (2/3) ... [2024-10-14 07:17:40,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1b19f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:17:40, skipping insertion in model container [2024-10-14 07:17:40,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:17:40" (3/3) ... [2024-10-14 07:17:40,670 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-42.i [2024-10-14 07:17:40,681 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:17:40,682 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:17:40,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:17:40,734 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;@1efa5972, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:17:40,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:17:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 07:17:40,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 07:17:40,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:17:40,751 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:17:40,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:17:40,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:17:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1284073153, now seen corresponding path program 1 times [2024-10-14 07:17:40,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:17:40,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132161590] [2024-10-14 07:17:40,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:40,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:17:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:40,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:17:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:40,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:17:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:40,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:17:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:40,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:17:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:40,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:17:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:17:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:17:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:17:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:17:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:17:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:17:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:17:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:17:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:17:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132161590] [2024-10-14 07:17:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132161590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:17:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:17:41,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:17:41,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890460075] [2024-10-14 07:17:41,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:17:41,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:17:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:17:41,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:17:41,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:17:41,082 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:17:41,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:17:41,131 INFO L93 Difference]: Finished difference Result 83 states and 146 transitions. [2024-10-14 07:17:41,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:17:41,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-10-14 07:17:41,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:17:41,139 INFO L225 Difference]: With dead ends: 83 [2024-10-14 07:17:41,139 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 07:17:41,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-14 07:17:41,145 INFO L432 NwaCegarLoop]: 59 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, 59 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-14 07:17:41,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:17:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 07:17:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 07:17:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 07:17:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 62 transitions. [2024-10-14 07:17:41,178 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 62 transitions. Word has length 79 [2024-10-14 07:17:41,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:17:41,179 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 62 transitions. [2024-10-14 07:17:41,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:17:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 62 transitions. [2024-10-14 07:17:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 07:17:41,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:17:41,182 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:17:41,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:17:41,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:17:41,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:17:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1666905789, now seen corresponding path program 1 times [2024-10-14 07:17:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:17:41,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989056993] [2024-10-14 07:17:41,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:41,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:17:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:17:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:17:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:17:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:17:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:17:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:17:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:17:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:17:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:17:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:17:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:17:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:17:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:17:41,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:17:41,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989056993] [2024-10-14 07:17:41,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989056993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:17:41,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:17:41,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:17:41,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422423181] [2024-10-14 07:17:41,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:17:41,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:17:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:17:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:17:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:17:41,649 INFO L87 Difference]: Start difference. First operand 41 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:17:41,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:17:41,782 INFO L93 Difference]: Finished difference Result 122 states and 185 transitions. [2024-10-14 07:17:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:17:41,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-14 07:17:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:17:41,785 INFO L225 Difference]: With dead ends: 122 [2024-10-14 07:17:41,788 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 07:17:41,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-14 07:17:41,789 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 56 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:17:41,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 171 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:17:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 07:17:41,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2024-10-14 07:17:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 07:17:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-10-14 07:17:41,813 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 79 [2024-10-14 07:17:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:17:41,815 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-10-14 07:17:41,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:17:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-10-14 07:17:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 07:17:41,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:17:41,818 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:17:41,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:17:41,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:17:41,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:17:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1291316654, now seen corresponding path program 1 times [2024-10-14 07:17:41,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:17:41,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442548161] [2024-10-14 07:17:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:41,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:17:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:17:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:17:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:17:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:17:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:17:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:17:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:17:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:17:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:17:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:17:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:17:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:17:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:17:42,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:17:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442548161] [2024-10-14 07:17:42,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442548161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:17:42,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:17:42,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:17:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935650315] [2024-10-14 07:17:42,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:17:42,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:17:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:17:42,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:17:42,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:17:42,190 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:17:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:17:42,378 INFO L93 Difference]: Finished difference Result 159 states and 239 transitions. [2024-10-14 07:17:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:17:42,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-10-14 07:17:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:17:42,382 INFO L225 Difference]: With dead ends: 159 [2024-10-14 07:17:42,382 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 07:17:42,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-14 07:17:42,384 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 60 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:17:42,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 173 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:17:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 07:17:42,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2024-10-14 07:17:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 07:17:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2024-10-14 07:17:42,425 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 80 [2024-10-14 07:17:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:17:42,426 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 157 transitions. [2024-10-14 07:17:42,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:17:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions. [2024-10-14 07:17:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 07:17:42,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:17:42,428 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:17:42,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:17:42,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:17:42,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:17:42,429 INFO L85 PathProgramCache]: Analyzing trace with hash 898289644, now seen corresponding path program 1 times [2024-10-14 07:17:42,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:17:42,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162289093] [2024-10-14 07:17:42,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:42,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:17:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:17:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:17:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:17:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:17:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:17:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:17:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:17:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:17:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:17:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:17:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:17:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:17:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:42,945 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-10-14 07:17:42,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:17:42,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162289093] [2024-10-14 07:17:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162289093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:17:42,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819997058] [2024-10-14 07:17:42,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:42,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:17:42,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:17:42,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:17:42,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 07:17:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:43,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 07:17:43,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:17:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-14 07:17:43,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:17:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-10-14 07:17:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819997058] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:17:43,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 07:17:43,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-14 07:17:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357884838] [2024-10-14 07:17:43,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 07:17:43,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 07:17:43,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:17:43,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 07:17:43,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:17:43,634 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 07:17:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:17:44,439 INFO L93 Difference]: Finished difference Result 374 states and 520 transitions. [2024-10-14 07:17:44,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-14 07:17:44,439 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 80 [2024-10-14 07:17:44,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:17:44,442 INFO L225 Difference]: With dead ends: 374 [2024-10-14 07:17:44,442 INFO L226 Difference]: Without dead ends: 296 [2024-10-14 07:17:44,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 177 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=482, Invalid=1410, Unknown=0, NotChecked=0, Total=1892 [2024-10-14 07:17:44,445 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 212 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:17:44,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 362 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:17:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-14 07:17:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 178. [2024-10-14 07:17:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 117 states have internal predecessors, (147), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:17:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 243 transitions. [2024-10-14 07:17:44,502 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 243 transitions. Word has length 80 [2024-10-14 07:17:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:17:44,502 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 243 transitions. [2024-10-14 07:17:44,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-14 07:17:44,502 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 243 transitions. [2024-10-14 07:17:44,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 07:17:44,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:17:44,504 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:17:44,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 07:17:44,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:17:44,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:17:44,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:17:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1578348014, now seen corresponding path program 1 times [2024-10-14 07:17:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:17:44,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448404336] [2024-10-14 07:17:44,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:44,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:17:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:17:44,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022468343] [2024-10-14 07:17:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:44,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:17:44,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:17:44,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:17:44,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 07:17:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:44,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 07:17:44,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:17:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-14 07:17:45,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:17:45,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:17:45,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448404336] [2024-10-14 07:17:45,527 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 07:17:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022468343] [2024-10-14 07:17:45,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022468343] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:17:45,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:17:45,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-10-14 07:17:45,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735399072] [2024-10-14 07:17:45,527 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 07:17:45,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:17:45,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:17:45,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:17:45,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=75, Unknown=2, NotChecked=0, Total=110 [2024-10-14 07:17:45,529 INFO L87 Difference]: Start difference. First operand 178 states and 243 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:17:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:17:45,886 INFO L93 Difference]: Finished difference Result 536 states and 717 transitions. [2024-10-14 07:17:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 07:17:45,886 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2024-10-14 07:17:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:17:45,890 INFO L225 Difference]: With dead ends: 536 [2024-10-14 07:17:45,890 INFO L226 Difference]: Without dead ends: 397 [2024-10-14 07:17:45,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=228, Unknown=2, NotChecked=0, Total=342 [2024-10-14 07:17:45,892 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 97 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:17:45,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 254 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:17:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-14 07:17:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 335. [2024-10-14 07:17:45,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 225 states have (on average 1.231111111111111) internal successors, (277), 225 states have internal predecessors, (277), 84 states have call successors, (84), 25 states have call predecessors, (84), 25 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-14 07:17:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 445 transitions. [2024-10-14 07:17:45,994 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 445 transitions. Word has length 80 [2024-10-14 07:17:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:17:45,994 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 445 transitions. [2024-10-14 07:17:45,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:17:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 445 transitions. [2024-10-14 07:17:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 07:17:45,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:17:45,998 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:17:46,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 07:17:46,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:17:46,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:17:46,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:17:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash -679809667, now seen corresponding path program 1 times [2024-10-14 07:17:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:17:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793230890] [2024-10-14 07:17:46,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:46,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:17:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:17:46,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1159359070] [2024-10-14 07:17:46,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:46,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:17:46,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:17:46,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:17:46,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 07:17:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:17:46,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:17:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:17:46,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:17:46,460 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:17:46,461 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:17:46,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 07:17:46,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:17:46,666 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 07:17:46,738 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:17:46,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:17:46 BoogieIcfgContainer [2024-10-14 07:17:46,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:17:46,744 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:17:46,744 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:17:46,745 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:17:46,745 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:17:40" (3/4) ... [2024-10-14 07:17:46,750 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:17:46,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:17:46,752 INFO L158 Benchmark]: Toolchain (without parser) took 7087.23ms. Allocated memory was 169.9MB in the beginning and 274.7MB in the end (delta: 104.9MB). Free memory was 100.2MB in the beginning and 197.2MB in the end (delta: -97.1MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-10-14 07:17:46,752 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:17:46,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.68ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 85.6MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 07:17:46,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.15ms. Allocated memory is still 169.9MB. Free memory was 85.6MB in the beginning and 138.1MB in the end (delta: -52.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-10-14 07:17:46,753 INFO L158 Benchmark]: Boogie Preprocessor took 72.74ms. Allocated memory is still 169.9MB. Free memory was 138.1MB in the beginning and 132.5MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 07:17:46,753 INFO L158 Benchmark]: RCFGBuilder took 486.94ms. Allocated memory is still 169.9MB. Free memory was 132.5MB in the beginning and 110.1MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-14 07:17:46,753 INFO L158 Benchmark]: TraceAbstraction took 6077.66ms. Allocated memory was 169.9MB in the beginning and 274.7MB in the end (delta: 104.9MB). Free memory was 109.4MB in the beginning and 198.3MB in the end (delta: -88.9MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-10-14 07:17:46,753 INFO L158 Benchmark]: Witness Printer took 7.49ms. Allocated memory is still 274.7MB. Free memory was 198.3MB in the beginning and 197.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:17:46,755 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.17ms. Allocated memory is still 169.9MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.68ms. Allocated memory is still 169.9MB. Free memory was 99.9MB in the beginning and 85.6MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.15ms. Allocated memory is still 169.9MB. Free memory was 85.6MB in the beginning and 138.1MB in the end (delta: -52.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.74ms. Allocated memory is still 169.9MB. Free memory was 138.1MB in the beginning and 132.5MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 486.94ms. Allocated memory is still 169.9MB. Free memory was 132.5MB in the beginning and 110.1MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6077.66ms. Allocated memory was 169.9MB in the beginning and 274.7MB in the end (delta: 104.9MB). Free memory was 109.4MB in the beginning and 198.3MB in the end (delta: -88.9MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 7.49ms. Allocated memory is still 274.7MB. Free memory was 198.3MB in the beginning and 197.2MB in the end (delta: 1.0MB). There was no memory consumed. 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 someBinaryFLOATComparisonOperation at line 115, overapproximation of someUnaryDOUBLEoperation at line 30. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] signed short int last_1_var_1_1 = 16; [L37] unsigned char last_1_var_1_6 = 10; [L38] unsigned char last_1_var_1_8 = 1; [L39] signed short int last_1_var_1_13 = 200; [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L109] last_1_var_1_1 = var_1_1 [L110] last_1_var_1_6 = var_1_6 [L111] last_1_var_1_8 = var_1_8 [L112] last_1_var_1_13 = var_1_13 [L122] RET updateLastVariables() [L123] CALL updateVariables() [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=128, var_1_8=1] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=128, var_1_8=1] [L90] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=128, var_1_8=1] [L90] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=128, var_1_8=1] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L92] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L93] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L93] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L94] var_1_11 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L95] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L96] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L96] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L97] var_1_12 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L98] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L99] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L99] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L100] var_1_15 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L101] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L102] var_1_16 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L103] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L104] var_1_20 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L105] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L106] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L106] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L123] RET updateVariables() [L124] CALL step() [L43] COND TRUE (((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L44] COND FALSE !(last_1_var_1_1 <= last_1_var_1_6) [L47] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L52] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=10, var_1_7=-285, var_1_8=1] [L55] COND TRUE var_1_5 >= -2 [L56] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=127, var_1_7=-285, var_1_8=1] [L58] COND TRUE last_1_var_1_13 >= (var_1_6 / var_1_7) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=127, var_1_7=-285, var_1_8=1] [L59] COND TRUE var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L60] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=127, var_1_7=-285, var_1_8=1] [L67] COND FALSE !(var_1_6 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_5=-2, var_1_6=127, var_1_7=-285, var_1_8=1] [L70] COND TRUE \read(var_1_19) [L71] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_5=-2, var_1_6=127, var_1_7=-285, var_1_8=1] [L77] COND FALSE !((49.5f <= var_1_14) && (var_1_19 && var_1_19)) [L84] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_5=-2, var_1_6=127, var_1_7=-285, var_1_8=0] [L124] RET step() [L125] CALL, EXPR property() [L115-L116] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_5=-2, var_1_6=127, var_1_7=-285, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=227, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=127, var_1_20=0, var_1_5=-2, var_1_6=127, var_1_7=-285, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 425 mSDsluCounter, 1019 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 714 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 636 IncrementalHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 305 mSDtfsCounter, 636 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 470 GetRequests, 402 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=5, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 211 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 551 ConstructedInterpolants, 0 QuantifiedInterpolants, 1930 SizeOfPredicates, 8 NumberOfNonLiveVariables, 416 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 1791/1848 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-14 07:17:46,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-42.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a85c63270a82c8ef0a288aa71699029145198375482b0774861abf1408115eb1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:17:48,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:17:49,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:17:49,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:17:49,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:17:49,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:17:49,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:17:49,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:17:49,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:17:49,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:17:49,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:17:49,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:17:49,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:17:49,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:17:49,073 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:17:49,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:17:49,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:17:49,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:17:49,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:17:49,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:17:49,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:17:49,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:17:49,079 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:17:49,079 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:17:49,079 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:17:49,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:17:49,080 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:17:49,080 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:17:49,080 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:17:49,081 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:17:49,081 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:17:49,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:17:49,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:17:49,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:17:49,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:17:49,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:17:49,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:17:49,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:17:49,084 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:17:49,084 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:17:49,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:17:49,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:17:49,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:17:49,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:17:49,085 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:17:49,085 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/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/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 -> a85c63270a82c8ef0a288aa71699029145198375482b0774861abf1408115eb1 [2024-10-14 07:17:49,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:17:49,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:17:49,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:17:49,431 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:17:49,431 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:17:49,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-42.i [2024-10-14 07:17:50,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:17:51,138 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:17:51,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-42.i [2024-10-14 07:17:51,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8407d7f7/afa5838def2e44b0aff30576f6e7daed/FLAGaec1d7da3 [2024-10-14 07:17:51,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8407d7f7/afa5838def2e44b0aff30576f6e7daed [2024-10-14 07:17:51,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:17:51,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:17:51,166 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:17:51,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:17:51,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:17:51,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd08b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51, skipping insertion in model container [2024-10-14 07:17:51,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:17:51,336 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_codestructure_dependencies_file-42.i[919,932] [2024-10-14 07:17:51,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:17:51,428 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:17:51,449 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_codestructure_dependencies_file-42.i[919,932] [2024-10-14 07:17:51,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:17:51,506 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:17:51,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51 WrapperNode [2024-10-14 07:17:51,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:17:51,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:17:51,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:17:51,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:17:51,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,559 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-10-14 07:17:51,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:17:51,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:17:51,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:17:51,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:17:51,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,603 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-14 07:17:51,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:17:51,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:17:51,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:17:51,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:17:51,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (1/1) ... [2024-10-14 07:17:51,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:17:51,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:17:51,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:17:51,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:17:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:17:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:17:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:17:51,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:17:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:17:51,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:17:51,806 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:17:51,808 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:17:52,237 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 07:17:52,238 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:17:52,293 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:17:52,293 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:17:52,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:17:52 BoogieIcfgContainer [2024-10-14 07:17:52,294 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:17:52,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:17:52,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:17:52,299 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:17:52,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:17:51" (1/3) ... [2024-10-14 07:17:52,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f441aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:17:52, skipping insertion in model container [2024-10-14 07:17:52,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:51" (2/3) ... [2024-10-14 07:17:52,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f441aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:17:52, skipping insertion in model container [2024-10-14 07:17:52,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:17:52" (3/3) ... [2024-10-14 07:17:52,302 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-42.i [2024-10-14 07:17:52,333 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:17:52,334 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:17:52,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:17:52,401 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;@40819f90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:17:52,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:17:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 07:17:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 07:17:52,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:17:52,418 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:17:52,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:17:52,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:17:52,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1284073153, now seen corresponding path program 1 times [2024-10-14 07:17:52,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:17:52,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539201710] [2024-10-14 07:17:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:52,439 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-14 07:17:52,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:17:52,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-14 07:17:52,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 07:17:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:52,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:17:52,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:17:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2024-10-14 07:17:52,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:17:52,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:17:52,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539201710] [2024-10-14 07:17:52,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539201710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:17:52,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:17:52,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:17:52,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329736736] [2024-10-14 07:17:52,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:17:52,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:17:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:17:52,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:17:52,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:17:52,708 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:17:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:17:52,849 INFO L93 Difference]: Finished difference Result 83 states and 146 transitions. [2024-10-14 07:17:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:17:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-10-14 07:17:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:17:52,865 INFO L225 Difference]: With dead ends: 83 [2024-10-14 07:17:52,865 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 07:17:52,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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-14 07:17:52,872 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:17:52,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:17:52,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 07:17:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 07:17:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 07:17:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 62 transitions. [2024-10-14 07:17:52,917 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 62 transitions. Word has length 79 [2024-10-14 07:17:52,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:17:52,918 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 62 transitions. [2024-10-14 07:17:52,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 07:17:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 62 transitions. [2024-10-14 07:17:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 07:17:52,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:17:52,924 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:17:52,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-10-14 07:17:53,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-14 07:17:53,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:17:53,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:17:53,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1666905789, now seen corresponding path program 1 times [2024-10-14 07:17:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:17:53,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579467485] [2024-10-14 07:17:53,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:53,127 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-14 07:17:53,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:17:53,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-14 07:17:53,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 07:17:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:53,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 07:17:53,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:17:53,535 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:17:53,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:17:53,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:17:53,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579467485] [2024-10-14 07:17:53,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579467485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:17:53,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:17:53,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:17:53,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196481108] [2024-10-14 07:17:53,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:17:53,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:17:53,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:17:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:17:53,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:17:53,543 INFO L87 Difference]: Start difference. First operand 41 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:17:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:17:53,812 INFO L93 Difference]: Finished difference Result 122 states and 185 transitions. [2024-10-14 07:17:53,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:17:53,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-14 07:17:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:17:53,819 INFO L225 Difference]: With dead ends: 122 [2024-10-14 07:17:53,819 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 07:17:53,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 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-14 07:17:53,821 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 53 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:17:53,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 171 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:17:53,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 07:17:53,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 66. [2024-10-14 07:17:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 07:17:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-10-14 07:17:53,839 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 79 [2024-10-14 07:17:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:17:53,840 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-10-14 07:17:53,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:17:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-10-14 07:17:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 07:17:53,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:17:53,842 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:17:53,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-10-14 07:17:54,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-14 07:17:54,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:17:54,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:17:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1291316654, now seen corresponding path program 1 times [2024-10-14 07:17:54,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:17:54,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777670570] [2024-10-14 07:17:54,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:54,047 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-14 07:17:54,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:17:54,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-14 07:17:54,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (4)] Waiting until timeout for monitored process [2024-10-14 07:17:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:54,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 07:17:54,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:17:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 07:17:54,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:17:54,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:17:54,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777670570] [2024-10-14 07:17:54,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777670570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:17:54,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:17:54,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:17:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898938139] [2024-10-14 07:17:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:17:54,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:17:54,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:17:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:17:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:17:54,601 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:17:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:17:55,020 INFO L93 Difference]: Finished difference Result 159 states and 239 transitions. [2024-10-14 07:17:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:17:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 80 [2024-10-14 07:17:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:17:55,023 INFO L225 Difference]: With dead ends: 159 [2024-10-14 07:17:55,023 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 07:17:55,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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-14 07:17:55,028 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 57 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:17:55,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 171 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:17:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 07:17:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2024-10-14 07:17:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 07:17:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2024-10-14 07:17:55,062 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 80 [2024-10-14 07:17:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:17:55,063 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 157 transitions. [2024-10-14 07:17:55,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 07:17:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions. [2024-10-14 07:17:55,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 07:17:55,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:17:55,066 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:17:55,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (4)] Forceful destruction successful, exit code 0 [2024-10-14 07:17:55,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-14 07:17:55,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:17:55,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:17:55,268 INFO L85 PathProgramCache]: Analyzing trace with hash 898289644, now seen corresponding path program 1 times [2024-10-14 07:17:55,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:17:55,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120349954] [2024-10-14 07:17:55,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:55,269 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-14 07:17:55,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:17:55,274 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-14 07:17:55,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (5)] Waiting until timeout for monitored process [2024-10-14 07:17:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:55,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 07:17:55,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:17:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 149 proven. 9 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-14 07:17:55,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:17:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-10-14 07:17:55,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:17:55,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120349954] [2024-10-14 07:17:55,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120349954] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:17:55,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:17:55,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-14 07:17:55,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195575903] [2024-10-14 07:17:55,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:17:55,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 07:17:55,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:17:55,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 07:17:55,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:17:55,907 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 07:17:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:17:56,854 INFO L93 Difference]: Finished difference Result 282 states and 392 transitions. [2024-10-14 07:17:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 07:17:56,855 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 80 [2024-10-14 07:17:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:17:56,857 INFO L225 Difference]: With dead ends: 282 [2024-10-14 07:17:56,857 INFO L226 Difference]: Without dead ends: 204 [2024-10-14 07:17:56,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-10-14 07:17:56,862 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 194 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:17:56,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 248 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 07:17:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-14 07:17:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 178. [2024-10-14 07:17:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 117 states have (on average 1.2564102564102564) internal successors, (147), 117 states have internal predecessors, (147), 48 states have call successors, (48), 12 states have call predecessors, (48), 12 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:17:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 243 transitions. [2024-10-14 07:17:56,910 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 243 transitions. Word has length 80 [2024-10-14 07:17:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:17:56,911 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 243 transitions. [2024-10-14 07:17:56,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 07:17:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 243 transitions. [2024-10-14 07:17:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 07:17:56,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:17:56,914 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:17:56,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (5)] Ended with exit code 0 [2024-10-14 07:17:57,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-14 07:17:57,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:17:57,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:17:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1578348014, now seen corresponding path program 1 times [2024-10-14 07:17:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:17:57,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822158799] [2024-10-14 07:17:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:57,117 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-14 07:17:57,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:17:57,120 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-14 07:17:57,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (6)] Waiting until timeout for monitored process [2024-10-14 07:17:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:57,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 07:17:57,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:17:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-14 07:17:57,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:17:57,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:17:57,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822158799] [2024-10-14 07:17:57,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822158799] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:17:57,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1578518861] [2024-10-14 07:17:57,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:17:57,842 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 07:17:57,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 07:17:57,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 07:17:57,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-14 07:17:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:17:57,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-14 07:17:57,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:17:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-14 07:17:58,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:18:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1578518861] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:18:00,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 07:18:00,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2024-10-14 07:18:00,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662248085] [2024-10-14 07:18:00,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 07:18:00,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 07:18:00,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:18:00,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 07:18:00,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-14 07:18:00,229 INFO L87 Difference]: Start difference. First operand 178 states and 243 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-14 07:18:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:18:01,109 INFO L93 Difference]: Finished difference Result 373 states and 506 transitions. [2024-10-14 07:18:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 07:18:01,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 80 [2024-10-14 07:18:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:18:01,117 INFO L225 Difference]: With dead ends: 373 [2024-10-14 07:18:01,117 INFO L226 Difference]: Without dead ends: 234 [2024-10-14 07:18:01,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2024-10-14 07:18:01,119 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 131 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:18:01,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 244 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 07:18:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-14 07:18:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 189. [2024-10-14 07:18:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 127 states have internal predecessors, (156), 48 states have call successors, (48), 13 states have call predecessors, (48), 13 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:18:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2024-10-14 07:18:01,145 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 80 [2024-10-14 07:18:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:18:01,145 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2024-10-14 07:18:01,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-14 07:18:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2024-10-14 07:18:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 07:18:01,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:18:01,157 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:18:01,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (6)] Ended with exit code 0 [2024-10-14 07:18:01,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-14 07:18:01,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 07:18:01,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:18:01,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:18:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash -679809667, now seen corresponding path program 1 times [2024-10-14 07:18:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:18:01,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754818783] [2024-10-14 07:18:01,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:18:01,560 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-14 07:18:01,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:18:01,561 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-14 07:18:01,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (8)] Waiting until timeout for monitored process [2024-10-14 07:18:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:01,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 07:18:01,703 INFO L278 TraceCheckSpWp]: Computing forward predicates...