./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_operatoramount_amount50_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-72.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ab9e72004f6e44dd1c99d656a25b9afb9dd4f8a7dce6d645f7dcf92d5c06291 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:58:48,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:58:48,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:58:48,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:58:48,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:58:48,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:58:48,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:58:48,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:58:48,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:58:48,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:58:48,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:58:48,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:58:48,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:58:48,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:58:48,101 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:58:48,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:58:48,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:58:48,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:58:48,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:58:48,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:58:48,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:58:48,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:58:48,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:58:48,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:58:48,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:58:48,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:58:48,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:58:48,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:58:48,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:58:48,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:58:48,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:58:48,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:58:48,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:58:48,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:58:48,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:58:48,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:58:48,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:58:48,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:58:48,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:58:48,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:58:48,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:58:48,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:58:48,109 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ab9e72004f6e44dd1c99d656a25b9afb9dd4f8a7dce6d645f7dcf92d5c06291 [2024-10-11 12:58:48,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:58:48,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:58:48,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:58:48,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:58:48,339 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:58:48,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-72.i [2024-10-11 12:58:49,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:58:49,965 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:58:49,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-72.i [2024-10-11 12:58:49,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6399b7c7/356de52252964a2fb8e81065332385d0/FLAG11397ad9a [2024-10-11 12:58:50,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6399b7c7/356de52252964a2fb8e81065332385d0 [2024-10-11 12:58:50,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:58:50,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:58:50,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:58:50,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:58:50,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:58:50,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38970fce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50, skipping insertion in model container [2024-10-11 12:58:50,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:58:50,572 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_operatoramount_amount50_file-72.i[915,928] [2024-10-11 12:58:50,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:58:50,663 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:58:50,676 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_operatoramount_amount50_file-72.i[915,928] [2024-10-11 12:58:50,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:58:50,733 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:58:50,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50 WrapperNode [2024-10-11 12:58:50,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:58:50,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:58:50,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:58:50,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:58:50,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,791 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-10-11 12:58:50,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:58:50,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:58:50,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:58:50,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:58:50,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,822 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:58:50,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:58:50,834 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:58:50,834 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:58:50,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:58:50,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (1/1) ... [2024-10-11 12:58:50,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:58:50,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:58:50,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:58:50,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:58:50,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:58:50,907 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:58:50,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:58:50,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:58:50,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:58:50,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:58:50,986 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:58:50,987 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:58:51,231 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 12:58:51,232 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:58:51,292 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:58:51,292 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:58:51,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:58:51 BoogieIcfgContainer [2024-10-11 12:58:51,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:58:51,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:58:51,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:58:51,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:58:51,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:58:50" (1/3) ... [2024-10-11 12:58:51,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ecc2ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:58:51, skipping insertion in model container [2024-10-11 12:58:51,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:58:50" (2/3) ... [2024-10-11 12:58:51,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ecc2ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:58:51, skipping insertion in model container [2024-10-11 12:58:51,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:58:51" (3/3) ... [2024-10-11 12:58:51,300 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-72.i [2024-10-11 12:58:51,312 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:58:51,312 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:58:51,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:58:51,387 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;@7c24462c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:58:51,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:58:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 12:58:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 12:58:51,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:58:51,405 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:58:51,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:58:51,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:58:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash -432032975, now seen corresponding path program 1 times [2024-10-11 12:58:51,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:58:51,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14022222] [2024-10-11 12:58:51,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:51,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:58:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:58:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:58:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:58:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:58:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:58:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:58:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:58:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:58:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:58:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:58:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:58:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:58:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:58:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:58:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:58:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:58:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:58:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 12:58:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:58:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14022222] [2024-10-11 12:58:51,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14022222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:58:51,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:58:51,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:58:51,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006218578] [2024-10-11 12:58:51,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:58:51,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:58:51,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:58:51,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:58:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:58:51,752 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 12:58:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:58:51,791 INFO L93 Difference]: Finished difference Result 99 states and 173 transitions. [2024-10-11 12:58:51,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:58:51,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-10-11 12:58:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:58:51,799 INFO L225 Difference]: With dead ends: 99 [2024-10-11 12:58:51,799 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 12:58:51,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:58:51,806 INFO L432 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:58:51,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:58:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 12:58:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-11 12:58:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 12:58:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2024-10-11 12:58:51,863 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 107 [2024-10-11 12:58:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:58:51,863 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2024-10-11 12:58:51,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 12:58:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2024-10-11 12:58:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 12:58:51,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:58:51,870 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:58:51,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:58:51,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:58:51,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:58:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1389694925, now seen corresponding path program 1 times [2024-10-11 12:58:51,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:58:51,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807200374] [2024-10-11 12:58:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:51,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:58:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:58:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:58:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:58:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:58:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:58:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:58:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:58:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:58:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:58:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:58:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:58:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:58:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:58:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:58:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:58:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:58:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:58:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 12:58:52,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:58:52,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807200374] [2024-10-11 12:58:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807200374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:58:52,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:58:52,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:58:52,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072064813] [2024-10-11 12:58:52,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:58:52,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:58:52,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:58:52,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:58:52,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:58:52,379 INFO L87 Difference]: Start difference. First operand 49 states and 74 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:58:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:58:52,440 INFO L93 Difference]: Finished difference Result 110 states and 165 transitions. [2024-10-11 12:58:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:58:52,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-10-11 12:58:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:58:52,443 INFO L225 Difference]: With dead ends: 110 [2024-10-11 12:58:52,444 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 12:58:52,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:58:52,446 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:58:52,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 129 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:58:52,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 12:58:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2024-10-11 12:58:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 12:58:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 78 transitions. [2024-10-11 12:58:52,459 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 78 transitions. Word has length 107 [2024-10-11 12:58:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:58:52,462 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 78 transitions. [2024-10-11 12:58:52,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:58:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 78 transitions. [2024-10-11 12:58:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 12:58:52,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:58:52,465 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:58:52,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:58:52,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:58:52,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:58:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1203617750, now seen corresponding path program 1 times [2024-10-11 12:58:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:58:52,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568045071] [2024-10-11 12:58:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:58:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:58:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:58:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:58:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:58:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:58:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:58:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:58:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:58:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:58:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:58:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:58:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:58:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:58:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:58:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:58:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:58:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:58:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:52,832 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 12:58:52,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:58:52,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568045071] [2024-10-11 12:58:52,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568045071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:58:52,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:58:52,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:58:52,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815418321] [2024-10-11 12:58:52,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:58:52,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:58:52,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:58:52,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:58:52,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:58:52,836 INFO L87 Difference]: Start difference. First operand 52 states and 78 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:58:52,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:58:52,990 INFO L93 Difference]: Finished difference Result 155 states and 233 transitions. [2024-10-11 12:58:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:58:52,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-11 12:58:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:58:52,994 INFO L225 Difference]: With dead ends: 155 [2024-10-11 12:58:52,995 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 12:58:52,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:58:52,996 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 52 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:58:52,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 200 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:58:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 12:58:53,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 85. [2024-10-11 12:58:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:58:53,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2024-10-11 12:58:53,012 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 108 [2024-10-11 12:58:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:58:53,013 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2024-10-11 12:58:53,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:58:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2024-10-11 12:58:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 12:58:53,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:58:53,015 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:58:53,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:58:53,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:58:53,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:58:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash 502553172, now seen corresponding path program 1 times [2024-10-11 12:58:53,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:58:53,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076380857] [2024-10-11 12:58:53,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:53,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:58:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:58:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:58:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:58:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:58:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:58:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:58:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:58:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:58:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:58:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:58:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:58:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:58:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:58:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:58:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:58:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:58:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:58:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 12:58:53,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:58:53,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076380857] [2024-10-11 12:58:53,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076380857] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:58:53,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595219686] [2024-10-11 12:58:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:53,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:58:53,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:58:53,232 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:58:53,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:58:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:53,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 12:58:53,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:58:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-11 12:58:53,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:58:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 12:58:53,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595219686] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:58:53,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:58:53,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 12:58:53,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244527579] [2024-10-11 12:58:53,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:58:53,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:58:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:58:53,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:58:53,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:58:53,661 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 12:58:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:58:53,828 INFO L93 Difference]: Finished difference Result 148 states and 214 transitions. [2024-10-11 12:58:53,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:58:53,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 108 [2024-10-11 12:58:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:58:53,830 INFO L225 Difference]: With dead ends: 148 [2024-10-11 12:58:53,830 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 12:58:53,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 12:58:53,832 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 54 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:58:53,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 131 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:58:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 12:58:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2024-10-11 12:58:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:58:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-10-11 12:58:53,848 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 108 [2024-10-11 12:58:53,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:58:53,849 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-10-11 12:58:53,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 12:58:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-10-11 12:58:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 12:58:53,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:58:53,851 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:58:53,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:58:54,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:58:54,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:58:54,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:58:54,053 INFO L85 PathProgramCache]: Analyzing trace with hash -306793454, now seen corresponding path program 1 times [2024-10-11 12:58:54,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:58:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38448900] [2024-10-11 12:58:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:58:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:58:54,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1159812345] [2024-10-11 12:58:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:54,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:58:54,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:58:54,107 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:58:54,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 12:58:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 12:58:54,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:58:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 12:58:54,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:58:54,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:58:54,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38448900] [2024-10-11 12:58:54,504 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 12:58:54,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159812345] [2024-10-11 12:58:54,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159812345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:58:54,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:58:54,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:58:54,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398217067] [2024-10-11 12:58:54,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:58:54,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:58:54,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:58:54,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:58:54,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:58:54,507 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:58:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:58:54,591 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2024-10-11 12:58:54,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:58:54,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-11 12:58:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:58:54,593 INFO L225 Difference]: With dead ends: 164 [2024-10-11 12:58:54,593 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 12:58:54,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:58:54,594 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:58:54,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 200 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:58:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 12:58:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 94. [2024-10-11 12:58:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:58:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2024-10-11 12:58:54,638 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 108 [2024-10-11 12:58:54,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:58:54,641 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2024-10-11 12:58:54,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:58:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2024-10-11 12:58:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 12:58:54,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:58:54,643 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:58:54,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 12:58:54,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:58:54,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:58:54,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:58:54,845 INFO L85 PathProgramCache]: Analyzing trace with hash -673155892, now seen corresponding path program 1 times [2024-10-11 12:58:54,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:58:54,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858371925] [2024-10-11 12:58:54,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:54,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:58:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:58:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:58:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:58:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:58:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:58:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:58:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:58:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:58:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:58:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:58:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:58:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:58:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:58:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:58:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:58:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:58:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:58:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 12:58:54,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:58:54,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858371925] [2024-10-11 12:58:54,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858371925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:58:54,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:58:54,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:58:54,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481227576] [2024-10-11 12:58:54,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:58:54,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:58:54,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:58:54,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:58:54,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:58:54,949 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 12:58:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:58:55,042 INFO L93 Difference]: Finished difference Result 201 states and 285 transitions. [2024-10-11 12:58:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:58:55,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2024-10-11 12:58:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:58:55,044 INFO L225 Difference]: With dead ends: 201 [2024-10-11 12:58:55,044 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 12:58:55,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:58:55,045 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 104 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:58:55,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 121 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:58:55,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 12:58:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 94. [2024-10-11 12:58:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:58:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2024-10-11 12:58:55,063 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 108 [2024-10-11 12:58:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:58:55,064 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2024-10-11 12:58:55,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 12:58:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2024-10-11 12:58:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 12:58:55,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:58:55,065 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:58:55,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:58:55,065 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:58:55,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:58:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1941491293, now seen corresponding path program 1 times [2024-10-11 12:58:55,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:58:55,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353282661] [2024-10-11 12:58:55,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:55,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:58:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:58:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:58:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:58:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:58:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:58:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:58:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:58:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:58:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:58:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:58:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:58:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:58:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:58:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:58:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:58:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:58:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:58:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 12:58:55,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:58:55,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353282661] [2024-10-11 12:58:55,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353282661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:58:55,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:58:55,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:58:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786018205] [2024-10-11 12:58:55,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:58:55,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:58:55,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:58:55,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:58:55,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:58:55,197 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:58:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:58:55,292 INFO L93 Difference]: Finished difference Result 167 states and 234 transitions. [2024-10-11 12:58:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:58:55,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-10-11 12:58:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:58:55,294 INFO L225 Difference]: With dead ends: 167 [2024-10-11 12:58:55,294 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 12:58:55,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:58:55,295 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 41 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:58:55,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 204 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:58:55,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 12:58:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2024-10-11 12:58:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:58:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2024-10-11 12:58:55,315 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 109 [2024-10-11 12:58:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:58:55,316 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2024-10-11 12:58:55,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:58:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2024-10-11 12:58:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 12:58:55,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:58:55,317 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:58:55,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 12:58:55,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:58:55,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:58:55,318 INFO L85 PathProgramCache]: Analyzing trace with hash 372692702, now seen corresponding path program 1 times [2024-10-11 12:58:55,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:58:55,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142655124] [2024-10-11 12:58:55,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:58:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:58:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:58:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:58:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:58:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:58:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:58:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:58:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:58:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:58:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:58:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:58:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:58:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:58:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:58:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:58:55,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:58:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:58:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:58:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 12:58:55,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:58:55,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142655124] [2024-10-11 12:58:55,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142655124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:58:55,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:58:55,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:58:55,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676498706] [2024-10-11 12:58:55,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:58:55,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:58:55,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:58:55,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:58:55,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:58:55,431 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:58:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:58:55,533 INFO L93 Difference]: Finished difference Result 202 states and 285 transitions. [2024-10-11 12:58:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:58:55,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-10-11 12:58:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:58:55,536 INFO L225 Difference]: With dead ends: 202 [2024-10-11 12:58:55,536 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 12:58:55,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:58:55,536 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 94 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:58:55,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 119 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:58:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 12:58:55,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 92. [2024-10-11 12:58:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:58:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-10-11 12:58:55,553 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 109 [2024-10-11 12:58:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:58:55,554 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-10-11 12:58:55,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:58:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-10-11 12:58:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 12:58:55,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:58:55,555 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:58:55,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 12:58:55,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:58:55,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:58:55,555 INFO L85 PathProgramCache]: Analyzing trace with hash 396086349, now seen corresponding path program 1 times [2024-10-11 12:58:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:58:55,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117527365] [2024-10-11 12:58:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:55,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:58:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:58:55,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084734657] [2024-10-11 12:58:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:58:55,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:58:55,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:58:55,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:58:55,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 12:58:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:58:55,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:58:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:58:55,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:58:55,762 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:58:55,763 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:58:55,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 12:58:55,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:58:55,967 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:58:56,032 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:58:56,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:58:56 BoogieIcfgContainer [2024-10-11 12:58:56,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:58:56,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:58:56,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:58:56,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:58:56,036 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:58:51" (3/4) ... [2024-10-11 12:58:56,037 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:58:56,038 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:58:56,038 INFO L158 Benchmark]: Toolchain (without parser) took 5667.71ms. Allocated memory was 167.8MB in the beginning and 312.5MB in the end (delta: 144.7MB). Free memory was 94.3MB in the beginning and 156.3MB in the end (delta: -62.0MB). Peak memory consumption was 84.6MB. Max. memory is 16.1GB. [2024-10-11 12:58:56,039 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 123.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:58:56,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.44ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 136.8MB in the end (delta: -42.7MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-10-11 12:58:56,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.41ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 134.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:58:56,039 INFO L158 Benchmark]: Boogie Preprocessor took 42.13ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 130.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:58:56,039 INFO L158 Benchmark]: RCFGBuilder took 458.07ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 106.6MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 12:58:56,040 INFO L158 Benchmark]: TraceAbstraction took 4740.61ms. Allocated memory was 167.8MB in the beginning and 312.5MB in the end (delta: 144.7MB). Free memory was 106.6MB in the beginning and 157.4MB in the end (delta: -50.8MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2024-10-11 12:58:56,040 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 312.5MB. Free memory was 157.4MB in the beginning and 156.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:58:56,041 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.14ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 123.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.44ms. Allocated memory is still 167.8MB. Free memory was 94.2MB in the beginning and 136.8MB in the end (delta: -42.7MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.41ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 134.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.13ms. Allocated memory is still 167.8MB. Free memory was 134.9MB in the beginning and 130.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 458.07ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 106.6MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4740.61ms. Allocated memory was 167.8MB in the beginning and 312.5MB in the end (delta: 144.7MB). Free memory was 106.6MB in the beginning and 157.4MB in the end (delta: -50.8MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 312.5MB. Free memory was 157.4MB in the beginning and 156.3MB 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 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_10 = 2; [L24] signed char var_1_11 = 1; [L25] float var_1_14 = 64.3; [L26] signed char var_1_16 = 32; [L27] unsigned char var_1_17 = 1; [L28] unsigned char var_1_18 = 0; [L29] unsigned char var_1_19 = 0; [L30] double var_1_20 = 9.25; [L31] double var_1_21 = 255.05; [L32] double var_1_22 = 25.5; [L33] unsigned char var_1_23 = 2; [L34] unsigned char var_1_25 = 1; [L35] unsigned short int var_1_26 = 5; [L36] unsigned char var_1_27 = 128; [L37] unsigned char var_1_28 = 1; [L38] signed long int var_1_29 = 128; [L39] unsigned long int var_1_31 = 1; [L40] unsigned char last_1_var_1_17 = 1; [L41] double last_1_var_1_20 = 9.25; [L42] unsigned char last_1_var_1_23 = 2; [L43] unsigned short int last_1_var_1_26 = 5; [L44] signed long int last_1_var_1_29 = 128; [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L120] last_1_var_1_17 = var_1_17 [L121] last_1_var_1_20 = var_1_20 [L122] last_1_var_1_23 = var_1_23 [L123] last_1_var_1_26 = var_1_26 [L124] last_1_var_1_29 = var_1_29 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L91] var_1_11 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L92] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L93] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L93] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L94] var_1_14 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L95] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L96] var_1_16 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_16 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L97] RET assume_abort_if_not(var_1_16 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L98] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L98] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L99] var_1_18 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L100] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L101] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L101] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L102] var_1_19 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L103] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L104] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L104] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L105] var_1_21 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L106] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L107] var_1_22 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L108] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L109] var_1_25 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L110] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L111] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L111] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1] [L112] var_1_27 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=1, var_1_29=128, var_1_31=1] [L113] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=1, var_1_29=128, var_1_31=1] [L114] CALL assume_abort_if_not(var_1_27 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=1, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=1, var_1_29=128, var_1_31=1] [L114] RET assume_abort_if_not(var_1_27 <= 255) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=1, var_1_29=128, var_1_31=1] [L115] var_1_28 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_29=128, var_1_31=1] [L116] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_29=128, var_1_31=1] [L117] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=1] [L117] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=1] [L135] RET updateVariables() [L136] CALL step() [L48] COND TRUE (last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26 [L49] var_1_23 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=1] [L51] COND FALSE !((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=1] [L54] COND TRUE last_1_var_1_17 || last_1_var_1_17 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=1] [L55] COND TRUE (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20) [L56] var_1_10 = (var_1_11 + var_1_16) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=1] [L64] var_1_17 = (var_1_18 && var_1_19) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=1] [L65] COND FALSE !(! var_1_18) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=1] [L68] COND TRUE 256 >= var_1_10 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=1] [L69] COND FALSE !(var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) [L72] var_1_26 = var_1_28 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=15, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=1] [L77] var_1_31 = var_1_26 [L78] signed long int stepLocal_0 = var_1_23 * var_1_26; VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=15, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=15] [L79] COND FALSE !(((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) [L86] var_1_1 = -50 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=15, var_1_27=-129, var_1_28=15, var_1_29=128, var_1_31=15] [L88] var_1_29 = var_1_1 [L136] RET step() [L137] CALL, EXPR property() [L127-L128] return ((((((((((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) ? (((var_1_23 * var_1_26) <= (~ var_1_26)) ? (var_1_1 == ((signed short int) (((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) + var_1_23))) : (var_1_1 == ((signed short int) var_1_10))) : (var_1_1 == ((signed short int) -50))) && (((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) ? (var_1_10 == ((signed char) (var_1_11 + 10))) : ((last_1_var_1_17 || last_1_var_1_17) ? (((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) ? (var_1_10 == ((signed char) (var_1_11 + var_1_16))) : (var_1_10 == ((signed char) var_1_11))) : (var_1_10 == ((signed char) var_1_16))))) && (var_1_17 == ((unsigned char) (var_1_18 && var_1_19)))) && ((! var_1_18) ? (var_1_20 == ((double) ((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22))))) : 1)) && (((last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_25)) : 1)) && ((256 >= var_1_10) ? ((var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) ? (var_1_26 == ((unsigned short int) 16)) : (var_1_26 == ((unsigned short int) var_1_28))) : (var_1_26 == ((unsigned short int) var_1_25)))) && (var_1_29 == ((signed long int) var_1_1))) && (var_1_31 == ((unsigned long int) var_1_26)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=15, var_1_27=-129, var_1_28=15, var_1_29=-50, var_1_31=15] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=1, var_1_16=63, var_1_17=1, var_1_18=-255, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=15, var_1_27=-129, var_1_28=15, var_1_29=-50, var_1_31=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 9, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 399 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 394 mSDsluCounter, 1175 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 647 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 528 mSDtfsCounter, 267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 588 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=7, InterpolantAutomatonStates: 33, 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, 8 MinimizatonAttempts, 172 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1300 NumberOfCodeBlocks, 1300 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1070 ConstructedInterpolants, 0 QuantifiedInterpolants, 3269 SizeOfPredicates, 4 NumberOfNonLiveVariables, 551 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 5341/5440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:58:56,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-72.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ab9e72004f6e44dd1c99d656a25b9afb9dd4f8a7dce6d645f7dcf92d5c06291 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:58:58,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:58:58,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:58:58,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:58:58,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:58:58,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:58:58,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:58:58,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:58:58,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:58:58,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:58:58,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:58:58,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:58:58,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:58:58,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:58:58,193 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:58:58,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:58:58,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:58:58,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:58:58,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:58:58,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:58:58,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:58:58,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:58:58,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:58:58,196 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:58:58,196 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:58:58,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:58:58,196 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:58:58,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:58:58,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:58:58,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:58:58,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:58:58,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:58:58,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:58:58,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:58:58,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:58:58,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:58:58,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:58:58,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:58:58,199 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:58:58,199 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:58:58,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:58:58,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:58:58,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:58:58,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:58:58,200 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:58:58,200 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ab9e72004f6e44dd1c99d656a25b9afb9dd4f8a7dce6d645f7dcf92d5c06291 [2024-10-11 12:58:58,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:58:58,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:58:58,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:58:58,494 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:58:58,495 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:58:58,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-72.i [2024-10-11 12:58:59,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:59:00,174 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:59:00,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-72.i [2024-10-11 12:59:00,181 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/281f5648a/778a5227ef084a0c92dd3c91e9e68209/FLAGe9d420392 [2024-10-11 12:59:00,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/281f5648a/778a5227ef084a0c92dd3c91e9e68209 [2024-10-11 12:59:00,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:59:00,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:59:00,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:59:00,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:59:00,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:59:00,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc67698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00, skipping insertion in model container [2024-10-11 12:59:00,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:59:00,367 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_operatoramount_amount50_file-72.i[915,928] [2024-10-11 12:59:00,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:59:00,440 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:59:00,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_operatoramount_amount50_file-72.i[915,928] [2024-10-11 12:59:00,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:59:00,500 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:59:00,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00 WrapperNode [2024-10-11 12:59:00,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:59:00,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:59:00,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:59:00,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:59:00,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,551 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-10-11 12:59:00,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:59:00,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:59:00,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:59:00,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:59:00,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,577 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:59:00,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:59:00,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:59:00,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:59:00,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:59:00,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (1/1) ... [2024-10-11 12:59:00,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:59:00,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:59:00,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:59:00,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:59:00,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:59:00,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:59:00,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:59:00,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:59:00,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:59:00,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:59:00,783 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:59:00,785 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:59:09,388 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 12:59:09,388 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:59:09,465 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:59:09,465 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:59:09,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:59:09 BoogieIcfgContainer [2024-10-11 12:59:09,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:59:09,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:59:09,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:59:09,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:59:09,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:59:00" (1/3) ... [2024-10-11 12:59:09,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f06286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:59:09, skipping insertion in model container [2024-10-11 12:59:09,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:59:00" (2/3) ... [2024-10-11 12:59:09,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f06286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:59:09, skipping insertion in model container [2024-10-11 12:59:09,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:59:09" (3/3) ... [2024-10-11 12:59:09,473 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-72.i [2024-10-11 12:59:09,486 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:59:09,486 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:59:09,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:59:09,547 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;@2b9ea2db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:59:09,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:59:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 12:59:09,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 12:59:09,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:59:09,576 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:59:09,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:59:09,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:59:09,582 INFO L85 PathProgramCache]: Analyzing trace with hash -432032975, now seen corresponding path program 1 times [2024-10-11 12:59:09,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:59:09,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863010374] [2024-10-11 12:59:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:59:09,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:59:09,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:59:09,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:59:09,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:59:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:10,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:59:10,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:59:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-10-11 12:59:10,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:59:10,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:59:10,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863010374] [2024-10-11 12:59:10,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863010374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:59:10,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:59:10,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:59:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328246746] [2024-10-11 12:59:10,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:59:10,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:59:10,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:59:10,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:59:10,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:59:10,092 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 12:59:14,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:59:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:59:14,264 INFO L93 Difference]: Finished difference Result 99 states and 173 transitions. [2024-10-11 12:59:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:59:14,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-10-11 12:59:14,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:59:14,317 INFO L225 Difference]: With dead ends: 99 [2024-10-11 12:59:14,317 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 12:59:14,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:59:14,328 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:59:14,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 12:59:14,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 12:59:14,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-11 12:59:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 12:59:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2024-10-11 12:59:14,397 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 107 [2024-10-11 12:59:14,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:59:14,398 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2024-10-11 12:59:14,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 12:59:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-10-11 12:59:14,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 12:59:14,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:59:14,400 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:59:14,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 12:59:14,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:59:14,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:59:14,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:59:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1203617750, now seen corresponding path program 1 times [2024-10-11 12:59:14,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:59:14,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650125950] [2024-10-11 12:59:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:59:14,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:59:14,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:59:14,611 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:59:14,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:59:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:14,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:59:14,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:59:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 12:59:17,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:59:17,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:59:17,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650125950] [2024-10-11 12:59:17,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650125950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:59:17,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:59:17,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:59:17,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091924768] [2024-10-11 12:59:17,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:59:17,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:59:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:59:17,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:59:17,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:59:17,208 INFO L87 Difference]: Start difference. First operand 49 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:59:21,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:59:25,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:59:29,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:59:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:59:29,652 INFO L93 Difference]: Finished difference Result 146 states and 218 transitions. [2024-10-11 12:59:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:59:29,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-11 12:59:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:59:29,697 INFO L225 Difference]: With dead ends: 146 [2024-10-11 12:59:29,698 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 12:59:29,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:59:29,699 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 48 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 35 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:59:29,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 198 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 12.3s Time] [2024-10-11 12:59:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 12:59:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2024-10-11 12:59:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:59:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2024-10-11 12:59:29,717 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 122 transitions. Word has length 108 [2024-10-11 12:59:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:59:29,717 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 122 transitions. [2024-10-11 12:59:29,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:59:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 122 transitions. [2024-10-11 12:59:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 12:59:29,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:59:29,719 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:59:29,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 12:59:29,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:59:29,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:59:29,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:59:29,926 INFO L85 PathProgramCache]: Analyzing trace with hash 502553172, now seen corresponding path program 1 times [2024-10-11 12:59:29,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:59:29,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49604464] [2024-10-11 12:59:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:59:29,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:59:29,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:59:29,933 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:59:29,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:59:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:30,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:59:30,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:59:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 12:59:32,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:59:32,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:59:32,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49604464] [2024-10-11 12:59:32,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49604464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:59:32,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:59:32,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:59:32,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334900515] [2024-10-11 12:59:32,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:59:32,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:59:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:59:32,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:59:32,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:59:32,755 INFO L87 Difference]: Start difference. First operand 82 states and 122 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:59:37,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:59:41,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:59:45,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:59:49,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:59:53,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:59:53,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:59:53,280 INFO L93 Difference]: Finished difference Result 146 states and 217 transitions. [2024-10-11 12:59:53,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:59:53,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-10-11 12:59:53,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:59:53,324 INFO L225 Difference]: With dead ends: 146 [2024-10-11 12:59:53,324 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 12:59:53,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:59:53,326 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 35 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:59:53,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 200 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 14 Invalid, 5 Unknown, 0 Unchecked, 20.4s Time] [2024-10-11 12:59:53,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 12:59:53,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2024-10-11 12:59:53,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 12:59:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 123 transitions. [2024-10-11 12:59:53,338 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 123 transitions. Word has length 108 [2024-10-11 12:59:53,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:59:53,339 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 123 transitions. [2024-10-11 12:59:53,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:59:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 123 transitions. [2024-10-11 12:59:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 12:59:53,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:59:53,340 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:59:53,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 12:59:53,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:59:53,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:59:53,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:59:53,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1544129377, now seen corresponding path program 1 times [2024-10-11 12:59:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:59:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10619657] [2024-10-11 12:59:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:59:53,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:59:53,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:59:53,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:59:53,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 12:59:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:59:53,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 12:59:53,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:59:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 12:59:55,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:59:55,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:59:55,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10619657] [2024-10-11 12:59:55,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10619657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:59:55,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:59:55,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:59:55,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834276612] [2024-10-11 12:59:55,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:59:55,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:59:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:59:55,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:59:55,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:59:55,123 INFO L87 Difference]: Start difference. First operand 83 states and 123 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 12:59:59,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:00:02,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:00:07,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:00:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:07,077 INFO L93 Difference]: Finished difference Result 146 states and 216 transitions. [2024-10-11 13:00:07,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:00:07,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-10-11 13:00:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:07,119 INFO L225 Difference]: With dead ends: 146 [2024-10-11 13:00:07,119 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 13:00:07,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:00:07,120 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 38 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 35 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:07,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 204 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2024-10-11 13:00:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 13:00:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2024-10-11 13:00:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:00:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-10-11 13:00:07,132 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 109 [2024-10-11 13:00:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:07,133 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-10-11 13:00:07,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:00:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-10-11 13:00:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:00:07,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:07,136 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:07,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:00:07,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:00:07,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:07,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:07,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1205432975, now seen corresponding path program 1 times [2024-10-11 13:00:07,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:00:07,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097587417] [2024-10-11 13:00:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:07,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:00:07,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:00:07,339 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:00:07,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 13:00:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:07,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:00:07,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:00:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 246 proven. 33 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-11 13:00:08,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:00:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:00:09,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:00:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097587417] [2024-10-11 13:00:09,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097587417] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 13:00:09,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:00:09,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 13:00:09,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140486649] [2024-10-11 13:00:09,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:00:09,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:00:09,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:00:09,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:00:09,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:00:09,467 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 13:00:14,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:00:18,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:00:22,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:00:22,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:00:22,285 INFO L93 Difference]: Finished difference Result 144 states and 206 transitions. [2024-10-11 13:00:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:00:22,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 110 [2024-10-11 13:00:22,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:00:22,287 INFO L225 Difference]: With dead ends: 144 [2024-10-11 13:00:22,287 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 13:00:22,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:00:22,288 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 48 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:00:22,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 127 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 12.6s Time] [2024-10-11 13:00:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 13:00:22,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-10-11 13:00:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:00:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-10-11 13:00:22,301 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 110 [2024-10-11 13:00:22,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:00:22,301 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-10-11 13:00:22,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 13:00:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-10-11 13:00:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:00:22,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:00:22,303 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:00:22,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-11 13:00:22,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:00:22,504 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:00:22,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:00:22,504 INFO L85 PathProgramCache]: Analyzing trace with hash 396086349, now seen corresponding path program 1 times [2024-10-11 13:00:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:00:22,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367677791] [2024-10-11 13:00:22,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:00:22,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:00:22,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:00:22,506 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:00:22,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 13:00:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:00:22,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 13:00:22,871 INFO L278 TraceCheckSpWp]: Computing forward predicates...