./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-24.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 743595c72aff8d0f3b5fb9dea31749c854cf2066424a30dfc435f22c873187b9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:48:29,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:48:29,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:48:29,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:48:29,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:48:29,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:48:29,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:48:29,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:48:29,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:48:29,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:48:29,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:48:29,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:48:29,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:48:29,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:48:29,763 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:48:29,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:48:29,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:48:29,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:48:29,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:48:29,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:48:29,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:48:29,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:48:29,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:48:29,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:48:29,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:48:29,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:48:29,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:48:29,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:48:29,771 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:48:29,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:48:29,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:48:29,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:48:29,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:48:29,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:48:29,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:48:29,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:48:29,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:48:29,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:48:29,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:48:29,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:48:29,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:48:29,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:48:29,777 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 -> 743595c72aff8d0f3b5fb9dea31749c854cf2066424a30dfc435f22c873187b9 [2024-10-11 09:48:30,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:48:30,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:48:30,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:48:30,078 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:48:30,078 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:48:30,080 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-24.i [2024-10-11 09:48:31,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:48:31,934 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:48:31,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-24.i [2024-10-11 09:48:31,947 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4649b0915/f06d32711793459d81a651230fc79349/FLAG1a61c019e [2024-10-11 09:48:31,960 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4649b0915/f06d32711793459d81a651230fc79349 [2024-10-11 09:48:31,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:48:31,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:48:31,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:48:31,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:48:31,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:48:31,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:48:31" (1/1) ... [2024-10-11 09:48:31,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b5b65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:31, skipping insertion in model container [2024-10-11 09:48:31,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:48:31" (1/1) ... [2024-10-11 09:48:32,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:48:32,207 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-24.i[919,932] [2024-10-11 09:48:32,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:48:32,330 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:48:32,347 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-24.i[919,932] [2024-10-11 09:48:32,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:48:32,421 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:48:32,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32 WrapperNode [2024-10-11 09:48:32,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:48:32,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:48:32,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:48:32,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:48:32,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,488 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 298 [2024-10-11 09:48:32,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:48:32,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:48:32,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:48:32,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:48:32,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,540 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:48:32,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:48:32,571 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:48:32,571 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:48:32,571 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:48:32,572 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (1/1) ... [2024-10-11 09:48:32,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:48:32,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:48:32,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:48:32,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:48:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:48:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:48:32,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:48:32,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:48:32,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:48:32,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:48:32,800 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:48:32,802 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:48:33,379 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 09:48:33,380 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:48:33,427 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:48:33,427 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:48:33,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:48:33 BoogieIcfgContainer [2024-10-11 09:48:33,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:48:33,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:48:33,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:48:33,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:48:33,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:48:31" (1/3) ... [2024-10-11 09:48:33,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1fe0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:48:33, skipping insertion in model container [2024-10-11 09:48:33,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:32" (2/3) ... [2024-10-11 09:48:33,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b1fe0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:48:33, skipping insertion in model container [2024-10-11 09:48:33,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:48:33" (3/3) ... [2024-10-11 09:48:33,441 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-24.i [2024-10-11 09:48:33,462 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:48:33,462 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:48:33,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:48:33,561 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;@4cd5a5f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:48:33,562 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:48:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 83 states have internal predecessors, (124), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 09:48:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-11 09:48:33,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:33,592 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:33,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:33,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:33,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1771426148, now seen corresponding path program 1 times [2024-10-11 09:48:33,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:33,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489394707] [2024-10-11 09:48:33,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:33,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:33,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:48:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:48:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:48:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:48:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:48:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:48:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:48:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:48:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:48:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:48:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:48:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:48:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:48:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:48:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:48:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:48:34,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:48:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:48:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:48:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:48:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:48:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:48:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:48:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:48:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:48:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:48:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:48:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:48:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:48:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:48:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:48:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:48:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:48:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:48:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:48:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:48:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:48:34,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:34,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489394707] [2024-10-11 09:48:34,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489394707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:48:34,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:48:34,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:48:34,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208868964] [2024-10-11 09:48:34,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:48:34,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:48:34,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:34,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:48:34,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:48:34,357 INFO L87 Difference]: Start difference. First operand has 121 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 83 states have internal predecessors, (124), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 09:48:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:34,416 INFO L93 Difference]: Finished difference Result 239 states and 426 transitions. [2024-10-11 09:48:34,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:48:34,419 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 226 [2024-10-11 09:48:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:34,430 INFO L225 Difference]: With dead ends: 239 [2024-10-11 09:48:34,431 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 09:48:34,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:48:34,443 INFO L432 NwaCegarLoop]: 188 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, 188 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:34,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:48:34,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 09:48:34,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-11 09:48:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 09:48:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 191 transitions. [2024-10-11 09:48:34,513 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 191 transitions. Word has length 226 [2024-10-11 09:48:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:34,516 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 191 transitions. [2024-10-11 09:48:34,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 09:48:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 191 transitions. [2024-10-11 09:48:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-11 09:48:34,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:34,522 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:34,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:48:34,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:34,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:34,524 INFO L85 PathProgramCache]: Analyzing trace with hash -930870684, now seen corresponding path program 1 times [2024-10-11 09:48:34,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:34,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748125147] [2024-10-11 09:48:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:48:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:48:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:48:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:48:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:48:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:48:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:34,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:48:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:48:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:48:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:48:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:48:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:48:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:48:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:48:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:48:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:48:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:48:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:48:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:48:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:48:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:48:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:48:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:48:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:48:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:48:35,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:48:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:48:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:48:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:48:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:48:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:48:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:48:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:48:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:48:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:48:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:48:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:48:35,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:35,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748125147] [2024-10-11 09:48:35,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748125147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:48:35,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:48:35,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:48:35,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129719964] [2024-10-11 09:48:35,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:48:35,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:48:35,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:35,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:48:35,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:48:35,327 INFO L87 Difference]: Start difference. First operand 119 states and 191 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:35,483 INFO L93 Difference]: Finished difference Result 355 states and 571 transitions. [2024-10-11 09:48:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:48:35,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 226 [2024-10-11 09:48:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:35,490 INFO L225 Difference]: With dead ends: 355 [2024-10-11 09:48:35,490 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 09:48:35,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:48:35,493 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 125 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:35,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 385 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:48:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 09:48:35,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-11 09:48:35,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 160 states have (on average 1.45625) internal successors, (233), 160 states have internal predecessors, (233), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 09:48:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 377 transitions. [2024-10-11 09:48:35,553 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 377 transitions. Word has length 226 [2024-10-11 09:48:35,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:35,554 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 377 transitions. [2024-10-11 09:48:35,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 377 transitions. [2024-10-11 09:48:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 09:48:35,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:35,559 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:35,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:48:35,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:35,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash -659643217, now seen corresponding path program 1 times [2024-10-11 09:48:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274702302] [2024-10-11 09:48:35,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:48:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:48:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:48:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:48:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:48:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:48:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:48:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:48:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:48:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:48:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:48:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:48:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:48:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:48:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:48:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:48:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:48:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:48:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:48:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:48:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:48:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:48:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:48:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:48:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:48:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:48:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:48:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:48:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:48:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:48:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:48:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:48:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:48:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:48:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:48:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:48:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:48:35,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:35,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274702302] [2024-10-11 09:48:35,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274702302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:48:35,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:48:35,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:48:35,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620014381] [2024-10-11 09:48:35,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:48:35,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:48:35,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:35,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:48:35,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:48:35,835 INFO L87 Difference]: Start difference. First operand 235 states and 377 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:36,022 INFO L93 Difference]: Finished difference Result 699 states and 1121 transitions. [2024-10-11 09:48:36,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:48:36,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2024-10-11 09:48:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:36,032 INFO L225 Difference]: With dead ends: 699 [2024-10-11 09:48:36,033 INFO L226 Difference]: Without dead ends: 465 [2024-10-11 09:48:36,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:48:36,037 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 179 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:36,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 404 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:48:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-11 09:48:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 463. [2024-10-11 09:48:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 314 states have (on average 1.4203821656050954) internal successors, (446), 314 states have internal predecessors, (446), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2024-10-11 09:48:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 734 transitions. [2024-10-11 09:48:36,145 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 734 transitions. Word has length 228 [2024-10-11 09:48:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:36,146 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 734 transitions. [2024-10-11 09:48:36,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 734 transitions. [2024-10-11 09:48:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 09:48:36,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:36,153 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:36,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:48:36,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:36,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:36,154 INFO L85 PathProgramCache]: Analyzing trace with hash -912152783, now seen corresponding path program 1 times [2024-10-11 09:48:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:36,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200763988] [2024-10-11 09:48:36,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:36,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:48:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:48:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:48:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:48:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:48:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:48:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:48:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:48:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:48:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:48:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:48:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:48:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:48:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:48:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:48:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:48:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:48:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:48:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:48:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:48:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:48:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:48:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:48:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:48:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:48:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:48:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:48:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:48:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:48:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:48:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:48:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:48:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:48:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:48:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:48:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:48:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:48:36,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:36,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200763988] [2024-10-11 09:48:36,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200763988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:48:36,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:48:36,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:48:36,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133943373] [2024-10-11 09:48:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:48:36,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:48:36,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:36,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:48:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:48:36,356 INFO L87 Difference]: Start difference. First operand 463 states and 734 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:36,449 INFO L93 Difference]: Finished difference Result 697 states and 1105 transitions. [2024-10-11 09:48:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:48:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2024-10-11 09:48:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:36,455 INFO L225 Difference]: With dead ends: 697 [2024-10-11 09:48:36,456 INFO L226 Difference]: Without dead ends: 465 [2024-10-11 09:48:36,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:48:36,460 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 186 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:36,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 531 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:48:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-11 09:48:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 463. [2024-10-11 09:48:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 314 states have (on average 1.4076433121019107) internal successors, (442), 314 states have internal predecessors, (442), 144 states have call successors, (144), 4 states have call predecessors, (144), 4 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2024-10-11 09:48:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 730 transitions. [2024-10-11 09:48:36,519 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 730 transitions. Word has length 228 [2024-10-11 09:48:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:36,520 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 730 transitions. [2024-10-11 09:48:36,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:36,520 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 730 transitions. [2024-10-11 09:48:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 09:48:36,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:36,523 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:36,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:48:36,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:36,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:36,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2133334567, now seen corresponding path program 1 times [2024-10-11 09:48:36,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:36,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022882361] [2024-10-11 09:48:36,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:36,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:48:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:48:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:48:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:48:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:48:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:48:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:48:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:48:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:48:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:48:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:48:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:48:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:48:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:48:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:48:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:48:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:48:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:48:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:48:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:48:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:48:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:48:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:48:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:48:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:48:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:48:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:48:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:48:36,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:48:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:48:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:48:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:48:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:48:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:48:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:48:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:48:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:48:36,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:36,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022882361] [2024-10-11 09:48:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022882361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:48:36,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:48:36,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:48:36,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091068187] [2024-10-11 09:48:36,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:48:36,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:48:36,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:36,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:48:36,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:48:36,962 INFO L87 Difference]: Start difference. First operand 463 states and 730 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:37,327 INFO L93 Difference]: Finished difference Result 1196 states and 1877 transitions. [2024-10-11 09:48:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:48:37,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2024-10-11 09:48:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:37,334 INFO L225 Difference]: With dead ends: 1196 [2024-10-11 09:48:37,334 INFO L226 Difference]: Without dead ends: 734 [2024-10-11 09:48:37,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:48:37,337 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 210 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:37,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 550 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:48:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-11 09:48:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 578. [2024-10-11 09:48:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 392 states have (on average 1.3979591836734695) internal successors, (548), 392 states have internal predecessors, (548), 180 states have call successors, (180), 5 states have call predecessors, (180), 5 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-10-11 09:48:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 908 transitions. [2024-10-11 09:48:37,407 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 908 transitions. Word has length 228 [2024-10-11 09:48:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:37,408 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 908 transitions. [2024-10-11 09:48:37,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 908 transitions. [2024-10-11 09:48:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-11 09:48:37,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:37,412 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:37,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:48:37,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:37,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1169669235, now seen corresponding path program 1 times [2024-10-11 09:48:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:37,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628921047] [2024-10-11 09:48:37,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:37,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:48:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:48:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:48:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:48:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:48:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:48:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:48:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:48:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:48:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:48:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:48:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:48:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:48:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:48:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:48:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:48:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:48:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:48:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:48:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:48:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:48:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:48:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:48:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:48:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:48:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:48:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:48:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:48:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:48:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:48:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:48:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:48:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:48:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:48:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:48:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:48:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:48:38,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:38,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628921047] [2024-10-11 09:48:38,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628921047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:48:38,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:48:38,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:48:38,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984151203] [2024-10-11 09:48:38,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:48:38,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:48:38,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:38,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:48:38,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:48:38,639 INFO L87 Difference]: Start difference. First operand 578 states and 908 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:39,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:39,286 INFO L93 Difference]: Finished difference Result 1270 states and 1991 transitions. [2024-10-11 09:48:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:48:39,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 229 [2024-10-11 09:48:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:39,293 INFO L225 Difference]: With dead ends: 1270 [2024-10-11 09:48:39,294 INFO L226 Difference]: Without dead ends: 693 [2024-10-11 09:48:39,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:48:39,298 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 84 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:39,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 393 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 09:48:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-11 09:48:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 684. [2024-10-11 09:48:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 461 states have (on average 1.3731019522776573) internal successors, (633), 461 states have internal predecessors, (633), 216 states have call successors, (216), 6 states have call predecessors, (216), 6 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2024-10-11 09:48:39,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1065 transitions. [2024-10-11 09:48:39,368 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1065 transitions. Word has length 229 [2024-10-11 09:48:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:39,369 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1065 transitions. [2024-10-11 09:48:39,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1065 transitions. [2024-10-11 09:48:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 09:48:39,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:39,373 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:39,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:48:39,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:39,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:39,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1551822640, now seen corresponding path program 1 times [2024-10-11 09:48:39,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:39,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049431265] [2024-10-11 09:48:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:39,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:48:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:48:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:48:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:48:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:48:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:48:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:48:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:48:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:48:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:48:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:48:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:48:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:48:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:48:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:48:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:48:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:48:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:48:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:48:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:48:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:48:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:48:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:48:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:48:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:48:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:48:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:48:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:48:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:48:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:48:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:48:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:48:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:48:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:48:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:48:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:48:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:39,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:48:39,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:39,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049431265] [2024-10-11 09:48:39,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049431265] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:48:39,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:48:39,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:48:39,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429322378] [2024-10-11 09:48:39,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:48:39,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:48:39,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:39,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:48:39,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:48:39,842 INFO L87 Difference]: Start difference. First operand 684 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:40,134 INFO L93 Difference]: Finished difference Result 1157 states and 1812 transitions. [2024-10-11 09:48:40,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:48:40,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 230 [2024-10-11 09:48:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:40,141 INFO L225 Difference]: With dead ends: 1157 [2024-10-11 09:48:40,141 INFO L226 Difference]: Without dead ends: 694 [2024-10-11 09:48:40,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:48:40,145 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 60 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:40,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 379 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:48:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-10-11 09:48:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 684. [2024-10-11 09:48:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 461 states have (on average 1.3731019522776573) internal successors, (633), 461 states have internal predecessors, (633), 216 states have call successors, (216), 6 states have call predecessors, (216), 6 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2024-10-11 09:48:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1065 transitions. [2024-10-11 09:48:40,233 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1065 transitions. Word has length 230 [2024-10-11 09:48:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:40,234 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1065 transitions. [2024-10-11 09:48:40,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1065 transitions. [2024-10-11 09:48:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 09:48:40,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:40,238 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:40,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 09:48:40,238 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:40,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1338440954, now seen corresponding path program 1 times [2024-10-11 09:48:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:40,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503044705] [2024-10-11 09:48:40,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:48:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:48:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:48:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:48:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:48:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:48:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:48:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:48:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:48:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:48:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:48:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:48:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:48:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:48:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:48:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:48:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:48:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:48:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:48:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:48:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:48:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:48:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:48:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:48:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:48:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:48:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:48:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:48:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:48:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:48:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:48:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:48:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:48:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:48:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:48:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:48:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:48:40,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:40,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503044705] [2024-10-11 09:48:40,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503044705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:48:40,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:48:40,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:48:40,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828786645] [2024-10-11 09:48:40,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:48:40,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:48:40,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:40,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:48:40,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:48:40,569 INFO L87 Difference]: Start difference. First operand 684 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:40,802 INFO L93 Difference]: Finished difference Result 1272 states and 1989 transitions. [2024-10-11 09:48:40,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:48:40,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 231 [2024-10-11 09:48:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:40,808 INFO L225 Difference]: With dead ends: 1272 [2024-10-11 09:48:40,809 INFO L226 Difference]: Without dead ends: 679 [2024-10-11 09:48:40,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:48:40,812 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 116 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:40,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 541 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:48:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-10-11 09:48:40,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 553. [2024-10-11 09:48:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 367 states have (on average 1.3787465940054495) internal successors, (506), 367 states have internal predecessors, (506), 180 states have call successors, (180), 5 states have call predecessors, (180), 5 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-10-11 09:48:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 866 transitions. [2024-10-11 09:48:40,865 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 866 transitions. Word has length 231 [2024-10-11 09:48:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:40,865 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 866 transitions. [2024-10-11 09:48:40,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 866 transitions. [2024-10-11 09:48:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 09:48:40,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:40,868 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:40,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 09:48:40,869 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:40,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash -828967864, now seen corresponding path program 1 times [2024-10-11 09:48:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267745053] [2024-10-11 09:48:40,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:48:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:48:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:48:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:48:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:48:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:48:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:48:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:48:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:48:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:48:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:48:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:48:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:48:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:48:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:48:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:48:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:48:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:48:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:48:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:48:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:48:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:48:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:48:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:48:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:48:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:48:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:48:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:48:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:48:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:48:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:48:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:48:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:48:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:48:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:48:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:48:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:48:41,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:41,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267745053] [2024-10-11 09:48:41,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267745053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:48:41,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:48:41,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:48:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272506917] [2024-10-11 09:48:41,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:48:41,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:48:41,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:41,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:48:41,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:48:41,215 INFO L87 Difference]: Start difference. First operand 553 states and 866 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:41,606 INFO L93 Difference]: Finished difference Result 1022 states and 1606 transitions. [2024-10-11 09:48:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:48:41,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 231 [2024-10-11 09:48:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:41,611 INFO L225 Difference]: With dead ends: 1022 [2024-10-11 09:48:41,612 INFO L226 Difference]: Without dead ends: 559 [2024-10-11 09:48:41,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:48:41,614 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 128 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:41,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 539 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:48:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-11 09:48:41,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 553. [2024-10-11 09:48:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 367 states have (on average 1.3760217983651226) internal successors, (505), 367 states have internal predecessors, (505), 180 states have call successors, (180), 5 states have call predecessors, (180), 5 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-10-11 09:48:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 865 transitions. [2024-10-11 09:48:41,661 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 865 transitions. Word has length 231 [2024-10-11 09:48:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:41,661 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 865 transitions. [2024-10-11 09:48:41,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 865 transitions. [2024-10-11 09:48:41,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 09:48:41,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:41,665 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:41,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 09:48:41,665 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:41,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1116540200, now seen corresponding path program 1 times [2024-10-11 09:48:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465103152] [2024-10-11 09:48:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:41,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:48:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:48:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:48:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:48:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:48:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:48:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:48:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:48:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:48:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:48:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:48:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:48:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:48:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:48:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:48:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:48:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:48:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:48:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:48:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:48:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:48:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:48:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:48:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:48:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:48:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:48:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:48:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:48:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:48:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:48:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:48:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:48:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:48:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:48:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:48:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:48:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 72 proven. 33 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:48:41,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:41,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465103152] [2024-10-11 09:48:41,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465103152] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:48:41,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685968844] [2024-10-11 09:48:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:41,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:48:41,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:48:41,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:48:41,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:48:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:42,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:48:42,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:48:42,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1139 proven. 33 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2024-10-11 09:48:42,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:48:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 72 proven. 33 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:48:42,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685968844] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:48:42,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:48:42,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 09:48:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95067212] [2024-10-11 09:48:42,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:48:42,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:48:42,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:42,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:48:42,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:48:42,678 INFO L87 Difference]: Start difference. First operand 553 states and 865 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-11 09:48:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:42,965 INFO L93 Difference]: Finished difference Result 1068 states and 1650 transitions. [2024-10-11 09:48:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:48:42,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 231 [2024-10-11 09:48:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:42,971 INFO L225 Difference]: With dead ends: 1068 [2024-10-11 09:48:42,971 INFO L226 Difference]: Without dead ends: 583 [2024-10-11 09:48:42,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 529 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 09:48:42,973 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 124 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:42,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 355 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:48:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-11 09:48:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 573. [2024-10-11 09:48:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 382 states have (on average 1.337696335078534) internal successors, (511), 382 states have internal predecessors, (511), 180 states have call successors, (180), 10 states have call predecessors, (180), 10 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-10-11 09:48:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 871 transitions. [2024-10-11 09:48:43,032 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 871 transitions. Word has length 231 [2024-10-11 09:48:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:43,032 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 871 transitions. [2024-10-11 09:48:43,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-11 09:48:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 871 transitions. [2024-10-11 09:48:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 09:48:43,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:43,036 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:43,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:48:43,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 09:48:43,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:43,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash 982526694, now seen corresponding path program 1 times [2024-10-11 09:48:43,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:43,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8215607] [2024-10-11 09:48:43,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:43,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:48:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:48:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:48:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:48:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:48:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:48:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:48:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:48:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:48:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:48:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 09:48:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:48:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:48:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:48:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:48:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:48:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:48:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:48:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:48:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:48:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:48:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:48:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:48:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:48:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:48:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:48:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:48:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:48:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:48:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:48:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:48:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:48:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 09:48:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:48:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 09:48:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-11 09:48:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 57 proven. 48 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:48:43,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:43,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8215607] [2024-10-11 09:48:43,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8215607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:48:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140971212] [2024-10-11 09:48:43,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:43,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:48:43,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:48:43,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:48:43,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:48:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:44,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:48:44,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:48:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1289 proven. 48 refuted. 0 times theorem prover too weak. 1183 trivial. 0 not checked. [2024-10-11 09:48:44,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:48:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 57 proven. 48 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:48:44,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140971212] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:48:44,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:48:44,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-11 09:48:44,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001657986] [2024-10-11 09:48:44,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:48:44,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:48:44,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:44,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:48:44,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:48:44,581 INFO L87 Difference]: Start difference. First operand 573 states and 871 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-10-11 09:48:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:45,358 INFO L93 Difference]: Finished difference Result 1110 states and 1663 transitions. [2024-10-11 09:48:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 09:48:45,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 231 [2024-10-11 09:48:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:45,365 INFO L225 Difference]: With dead ends: 1110 [2024-10-11 09:48:45,365 INFO L226 Difference]: Without dead ends: 613 [2024-10-11 09:48:45,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 529 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-11 09:48:45,368 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 419 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:45,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 503 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 09:48:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-10-11 09:48:45,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 593. [2024-10-11 09:48:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 397 states have (on average 1.2997481108312343) internal successors, (516), 397 states have internal predecessors, (516), 180 states have call successors, (180), 15 states have call predecessors, (180), 15 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-10-11 09:48:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 876 transitions. [2024-10-11 09:48:45,456 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 876 transitions. Word has length 231 [2024-10-11 09:48:45,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:45,457 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 876 transitions. [2024-10-11 09:48:45,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-10-11 09:48:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 876 transitions. [2024-10-11 09:48:45,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 09:48:45,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:45,461 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:45,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:48:45,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:48:45,664 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:45,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:45,664 INFO L85 PathProgramCache]: Analyzing trace with hash 559824868, now seen corresponding path program 1 times [2024-10-11 09:48:45,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:45,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368844863] [2024-10-11 09:48:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:45,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:48:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571989052] [2024-10-11 09:48:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:45,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:48:45,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:48:45,811 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:48:45,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:48:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:46,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:48:46,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:48:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:48:46,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:48:46,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:48:46,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368844863] [2024-10-11 09:48:46,349 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:48:46,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571989052] [2024-10-11 09:48:46,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571989052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:48:46,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:48:46,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:48:46,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567205265] [2024-10-11 09:48:46,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:48:46,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:48:46,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:48:46,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:48:46,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:48:46,352 INFO L87 Difference]: Start difference. First operand 593 states and 876 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (36), 1 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:46,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:46,802 INFO L93 Difference]: Finished difference Result 1129 states and 1662 transitions. [2024-10-11 09:48:46,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 09:48:46,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (36), 1 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 1 states have call successors, (36) Word has length 231 [2024-10-11 09:48:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:46,807 INFO L225 Difference]: With dead ends: 1129 [2024-10-11 09:48:46,808 INFO L226 Difference]: Without dead ends: 609 [2024-10-11 09:48:46,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:48:46,811 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 82 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:46,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 545 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:48:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-10-11 09:48:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 597. [2024-10-11 09:48:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 400 states have (on average 1.295) internal successors, (518), 400 states have internal predecessors, (518), 180 states have call successors, (180), 16 states have call predecessors, (180), 16 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-10-11 09:48:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 878 transitions. [2024-10-11 09:48:46,894 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 878 transitions. Word has length 231 [2024-10-11 09:48:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:46,894 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 878 transitions. [2024-10-11 09:48:46,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (36), 1 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:48:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 878 transitions. [2024-10-11 09:48:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 09:48:46,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:46,897 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:46,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 09:48:47,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:48:47,099 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:47,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1811914394, now seen corresponding path program 1 times [2024-10-11 09:48:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:48:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16792604] [2024-10-11 09:48:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:48:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:48:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [257788195] [2024-10-11 09:48:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:47,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:48:47,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:48:47,254 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:48:47,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 09:48:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:48:47,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:48:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:48:47,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:48:47,641 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:48:47,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:48:47,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 09:48:47,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 09:48:47,849 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:48,023 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:48:48,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:48:48 BoogieIcfgContainer [2024-10-11 09:48:48,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:48:48,028 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:48:48,028 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:48:48,028 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:48:48,029 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:48:33" (3/4) ... [2024-10-11 09:48:48,031 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:48:48,032 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:48:48,032 INFO L158 Benchmark]: Toolchain (without parser) took 16066.54ms. Allocated memory was 148.9MB in the beginning and 375.4MB in the end (delta: 226.5MB). Free memory was 92.5MB in the beginning and 133.4MB in the end (delta: -40.9MB). Peak memory consumption was 188.3MB. Max. memory is 16.1GB. [2024-10-11 09:48:48,033 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 148.9MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:48:48,033 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.39ms. Allocated memory is still 148.9MB. Free memory was 92.5MB in the beginning and 75.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 09:48:48,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.55ms. Allocated memory is still 148.9MB. Free memory was 75.3MB in the beginning and 72.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:48:48,033 INFO L158 Benchmark]: Boogie Preprocessor took 80.23ms. Allocated memory is still 148.9MB. Free memory was 72.0MB in the beginning and 68.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:48:48,034 INFO L158 Benchmark]: RCFGBuilder took 857.34ms. Allocated memory was 148.9MB in the beginning and 209.7MB in the end (delta: 60.8MB). Free memory was 68.2MB in the beginning and 158.3MB in the end (delta: -90.1MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2024-10-11 09:48:48,034 INFO L158 Benchmark]: TraceAbstraction took 14593.77ms. Allocated memory was 209.7MB in the beginning and 375.4MB in the end (delta: 165.7MB). Free memory was 157.3MB in the beginning and 133.4MB in the end (delta: 23.8MB). Peak memory consumption was 189.5MB. Max. memory is 16.1GB. [2024-10-11 09:48:48,035 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 375.4MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:48:48,036 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.11ms. Allocated memory is still 148.9MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 454.39ms. Allocated memory is still 148.9MB. Free memory was 92.5MB in the beginning and 75.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.55ms. Allocated memory is still 148.9MB. Free memory was 75.3MB in the beginning and 72.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.23ms. Allocated memory is still 148.9MB. Free memory was 72.0MB in the beginning and 68.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 857.34ms. Allocated memory was 148.9MB in the beginning and 209.7MB in the end (delta: 60.8MB). Free memory was 68.2MB in the beginning and 158.3MB in the end (delta: -90.1MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14593.77ms. Allocated memory was 209.7MB in the beginning and 375.4MB in the end (delta: 165.7MB). Free memory was 157.3MB in the beginning and 133.4MB in the end (delta: 23.8MB). Peak memory consumption was 189.5MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 375.4MB. Free memory is still 133.4MB. 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 someBinaryDOUBLEComparisonOperation at line 209, overapproximation of someBinaryArithmeticDOUBLEoperation at line 138, overapproximation of bitwiseAnd at line 123. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] double var_1_4 = 10.5; [L24] double var_1_5 = 1.55; [L25] signed char var_1_8 = -10; [L26] signed char var_1_10 = -16; [L27] signed char var_1_11 = -4; [L28] signed char var_1_12 = -16; [L29] double var_1_13 = 128.55; [L30] double var_1_14 = 2.3; [L31] double var_1_15 = 4.8; [L32] unsigned long int var_1_16 = 0; [L33] signed long int var_1_17 = 5; [L34] signed long int var_1_18 = 256; [L35] unsigned long int var_1_19 = 50; [L36] unsigned long int var_1_20 = 1; [L37] signed short int var_1_21 = -50; [L38] unsigned char var_1_23 = 1; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_28 = 0; [L42] unsigned char var_1_29 = 0; [L43] unsigned char var_1_30 = 1; [L44] unsigned long int var_1_31 = 200; [L45] unsigned long int var_1_34 = 50; [L46] unsigned char var_1_35 = 32; [L47] unsigned char var_1_36 = 10; [L48] double var_1_37 = 15.5; [L49] double var_1_38 = 99.375; [L50] signed long int var_1_39 = -10; [L51] unsigned long int var_1_42 = 10000; [L52] unsigned long int var_1_43 = 4251471014; [L53] signed short int var_1_44 = 64; [L54] unsigned char var_1_45 = 1; [L55] unsigned long int var_1_46 = 25; [L56] signed long int var_1_47 = -50; [L57] unsigned char var_1_48 = 0; [L58] double var_1_49 = 16.5; [L59] signed char last_1_var_1_8 = -10; [L60] signed short int last_1_var_1_21 = -50; [L61] unsigned char last_1_var_1_23 = 1; [L213] isInitial = 1 [L214] FCALL initially() [L215] COND TRUE 1 [L216] CALL updateLastVariables() [L204] last_1_var_1_8 = var_1_8 [L205] last_1_var_1_21 = var_1_21 [L206] last_1_var_1_23 = var_1_23 [L216] RET updateLastVariables() [L217] CALL updateVariables() [L146] var_1_4 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L147] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_5=31/20, var_1_8=-10] [L148] var_1_5 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L149] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=-16, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L150] var_1_10 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L151] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L152] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L152] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=-4, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L153] var_1_11 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_11 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L154] RET assume_abort_if_not(var_1_11 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L155] CALL assume_abort_if_not(var_1_11 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L155] RET assume_abort_if_not(var_1_11 <= 32) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=-16, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L156] var_1_12 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L157] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L158] CALL assume_abort_if_not(var_1_12 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L158] RET assume_abort_if_not(var_1_12 <= 31) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_14=23/10, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L159] var_1_14 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L160] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_15=24/5, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L161] var_1_15 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L162] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=5, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L163] var_1_17 = __VERIFIER_nondet_long() [L164] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L164] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L165] CALL assume_abort_if_not(var_1_17 <= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L165] RET assume_abort_if_not(var_1_17 <= 1073741824) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=256, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L166] var_1_18 = __VERIFIER_nondet_long() [L167] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L167] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L168] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L168] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=50, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L169] var_1_19 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L170] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L171] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L171] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=1, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L172] var_1_20 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L173] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L174] CALL assume_abort_if_not(var_1_20 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L174] RET assume_abort_if_not(var_1_20 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L175] var_1_24 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L176] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L177] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L177] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L178] var_1_28 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_28 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L179] RET assume_abort_if_not(var_1_28 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L180] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L180] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L181] var_1_29 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L182] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L183] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L183] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L184] var_1_30 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L185] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L186] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L186] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=50, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L187] var_1_34 = __VERIFIER_nondet_ulong() [L188] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L188] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L189] CALL assume_abort_if_not(var_1_34 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L189] RET assume_abort_if_not(var_1_34 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=10, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L190] var_1_36 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L191] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L192] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L192] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=795/8, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L193] var_1_38 = __VERIFIER_nondet_double() [L194] CALL assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L194] RET assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=4251471014, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L195] var_1_43 = __VERIFIER_nondet_ulong() [L196] CALL assume_abort_if_not(var_1_43 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L196] RET assume_abort_if_not(var_1_43 >= 3221225470) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L197] CALL assume_abort_if_not(var_1_43 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L197] RET assume_abort_if_not(var_1_43 <= 4294967294) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L198] var_1_45 = __VERIFIER_nondet_uchar() [L199] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L199] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L200] CALL assume_abort_if_not(var_1_45 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L200] RET assume_abort_if_not(var_1_45 <= 255) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L201] CALL assume_abort_if_not(var_1_45 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L201] RET assume_abort_if_not(var_1_45 != 0) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L217] RET updateVariables() [L218] CALL step() [L65] COND TRUE last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=-10] [L66] COND TRUE \read(last_1_var_1_23) [L67] var_1_8 = (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=64, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=16] [L72] COND FALSE !((var_1_16 / var_1_45) > ((((var_1_36) < 0 ) ? -(var_1_36) : (var_1_36)))) [L75] var_1_44 = var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=1, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=16] [L77] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=0, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=16] [L78] COND TRUE 32 >= var_1_21 [L79] var_1_25 = ((var_1_23 || (var_1_28 && var_1_29)) && var_1_30) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-10, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=16] [L81] COND FALSE !(! var_1_30) [L84] var_1_39 = (var_1_21 + ((((var_1_36) > ((var_1_21 + var_1_21))) ? (var_1_36) : ((var_1_21 + var_1_21))))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=33/2, var_1_8=16] [L86] var_1_49 = var_1_38 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=2, var_1_8=16] [L87] COND TRUE 128u >= var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_13=2571/20, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=2, var_1_8=16] [L88] COND TRUE ! var_1_23 [L89] var_1_13 = ((var_1_14 - var_1_15) + 0.25) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=2, var_1_8=16] [L98] EXPR 16u | var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=2, var_1_8=16] [L98] EXPR (((16u | var_1_8)) > (var_1_16)) ? ((16u | var_1_8)) : (var_1_16) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=2, var_1_8=16] [L98] EXPR 16u | var_1_8 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=2, var_1_8=16] [L98] EXPR (((16u | var_1_8)) > (var_1_16)) ? ((16u | var_1_8)) : (var_1_16) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=0, var_1_49=2, var_1_8=16] [L98] COND FALSE !(var_1_16 > (((((16u | var_1_8)) > (var_1_16)) ? ((16u | var_1_8)) : (var_1_16)))) [L103] var_1_48 = var_1_30 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=1, var_1_49=2, var_1_8=16] [L104] COND TRUE var_1_8 >= ((1329162249 - var_1_17) - var_1_18) [L105] var_1_16 = (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=31/2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=1, var_1_49=2, var_1_8=16] [L113] var_1_37 = var_1_38 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=1, var_1_49=2, var_1_8=16] [L114] COND FALSE !(((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=1, var_1_49=2, var_1_8=16] [L123] EXPR var_1_21 & -10 VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=2, var_1_38=2, var_1_39=-50, var_1_42=10000, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=25, var_1_47=-50, var_1_48=1, var_1_49=2, var_1_8=16] [L123] COND FALSE !((var_1_21 & -10) < var_1_16) [L132] var_1_42 = ((var_1_43 - var_1_36) - var_1_8) [L133] var_1_46 = var_1_43 [L134] var_1_47 = var_1_8 [L135] unsigned char stepLocal_1 = var_1_23; [L136] signed char stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_0=16, stepLocal_1=0, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_1=79/5, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=2, var_1_38=2, var_1_39=-50, var_1_42=3221225454, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=3221225470, var_1_47=16, var_1_48=1, var_1_49=2, var_1_8=16] [L137] COND TRUE stepLocal_0 >= var_1_16 [L138] var_1_1 = (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, stepLocal_1=0, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=2, var_1_38=2, var_1_39=-50, var_1_42=3221225454, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=3221225470, var_1_47=16, var_1_48=1, var_1_49=2, var_1_8=16] [L218] RET step() [L219] CALL, EXPR property() [L209] EXPR (((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=2, var_1_38=2, var_1_39=-50, var_1_42=3221225454, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=3221225470, var_1_47=16, var_1_48=1, var_1_49=2, var_1_8=16] [L209-L210] return ((((((var_1_8 >= var_1_16) ? (var_1_1 == ((double) (var_1_4 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) : ((var_1_23 || var_1_23) ? (var_1_1 == ((double) 128.75)) : 1)) && ((last_1_var_1_21 <= ((((last_1_var_1_21) < (last_1_var_1_8)) ? (last_1_var_1_21) : (last_1_var_1_8)))) ? (last_1_var_1_23 ? (var_1_8 == ((signed char) (-16 + ((((var_1_10) < ((var_1_11 + var_1_12))) ? (var_1_10) : ((var_1_11 + var_1_12))))))) : 1) : (var_1_8 == ((signed char) var_1_12)))) && ((128u >= var_1_8) ? ((! var_1_23) ? (var_1_13 == ((double) ((var_1_14 - var_1_15) + 0.25))) : (var_1_13 == ((double) var_1_14))) : (var_1_23 ? (var_1_13 == ((double) var_1_5)) : 1))) && ((var_1_8 >= ((1329162249 - var_1_17) - var_1_18)) ? (var_1_16 == ((unsigned long int) (((((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) < (var_1_19)) ? (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))) : (var_1_19))) + var_1_20))) : (var_1_23 ? (var_1_16 == ((unsigned long int) var_1_18)) : (var_1_16 == ((unsigned long int) var_1_19))))) && ((((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) <= (var_1_11 + var_1_8)) ? ((var_1_11 >= (var_1_18 & var_1_16)) ? (var_1_21 == ((signed short int) 8)) : ((var_1_19 < var_1_8) ? (var_1_21 == ((signed short int) 64)) : 1)) : 1)) && (var_1_23 == ((unsigned char) var_1_24)) ; [L219] RET, EXPR property() [L219] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=2, var_1_38=2, var_1_39=-50, var_1_42=3221225454, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=3221225470, var_1_47=16, var_1_48=1, var_1_49=2, var_1_8=16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-50, last_1_var_1_23=1, last_1_var_1_8=-10, var_1_10=32, var_1_11=8, var_1_12=25, var_1_16=0, var_1_17=664581117, var_1_18=664581117, var_1_19=0, var_1_20=0, var_1_21=-50, var_1_23=0, var_1_24=0, var_1_25=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=200, var_1_34=0, var_1_35=32, var_1_36=0, var_1_37=2, var_1_38=2, var_1_39=-50, var_1_42=3221225454, var_1_43=3221225470, var_1_44=16, var_1_45=1, var_1_46=3221225470, var_1_47=16, var_1_48=1, var_1_49=2, var_1_8=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 13, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1790 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1713 mSDsluCounter, 5313 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2883 mSDsCounter, 401 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1772 IncrementalHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 401 mSolverCounterUnsat, 2430 mSDtfsCounter, 1772 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2048 GetRequests, 1990 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=684occurred in iteration=6, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 355 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 3905 NumberOfCodeBlocks, 3905 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3658 ConstructedInterpolants, 0 QuantifiedInterpolants, 8440 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1581 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 40077/40320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 09:48:48,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-24.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 743595c72aff8d0f3b5fb9dea31749c854cf2066424a30dfc435f22c873187b9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:48:50,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:48:50,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:48:50,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:48:50,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:48:50,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:48:50,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:48:50,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:48:50,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:48:50,607 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:48:50,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:48:50,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:48:50,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:48:50,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:48:50,609 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:48:50,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:48:50,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:48:50,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:48:50,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:48:50,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:48:50,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:48:50,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:48:50,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:48:50,616 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:48:50,616 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:48:50,617 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:48:50,617 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:48:50,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:48:50,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:48:50,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:48:50,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:48:50,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:48:50,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:48:50,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:48:50,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:48:50,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:48:50,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:48:50,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:48:50,621 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:48:50,622 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:48:50,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:48:50,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:48:50,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:48:50,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:48:50,624 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:48:50,624 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 -> 743595c72aff8d0f3b5fb9dea31749c854cf2066424a30dfc435f22c873187b9 [2024-10-11 09:48:50,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:48:51,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:48:51,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:48:51,016 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:48:51,017 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:48:51,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-24.i [2024-10-11 09:48:52,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:48:52,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:48:52,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-24.i [2024-10-11 09:48:52,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e8397c37a/e12d2e773f5b4f8196c123ee51639efa/FLAG1452f8060 [2024-10-11 09:48:53,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e8397c37a/e12d2e773f5b4f8196c123ee51639efa [2024-10-11 09:48:53,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:48:53,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:48:53,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:48:53,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:48:53,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:48:53,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517dce4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53, skipping insertion in model container [2024-10-11 09:48:53,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:48:53,405 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-24.i[919,932] [2024-10-11 09:48:53,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:48:53,510 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:48:53,523 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-24.i[919,932] [2024-10-11 09:48:53,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:48:53,586 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:48:53,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53 WrapperNode [2024-10-11 09:48:53,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:48:53,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:48:53,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:48:53,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:48:53,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,659 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2024-10-11 09:48:53,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:48:53,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:48:53,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:48:53,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:48:53,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,697 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:48:53,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:48:53,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:48:53,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:48:53,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:48:53,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (1/1) ... [2024-10-11 09:48:53,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:48:53,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:48:53,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:48:53,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:48:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:48:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:48:53,839 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:48:53,839 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:48:53,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:48:53,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:48:53,963 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:48:53,966 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:48:57,425 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 09:48:57,425 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:48:57,495 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:48:57,496 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:48:57,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:48:57 BoogieIcfgContainer [2024-10-11 09:48:57,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:48:57,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:48:57,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:48:57,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:48:57,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:48:53" (1/3) ... [2024-10-11 09:48:57,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7726f8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:48:57, skipping insertion in model container [2024-10-11 09:48:57,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:48:53" (2/3) ... [2024-10-11 09:48:57,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7726f8b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:48:57, skipping insertion in model container [2024-10-11 09:48:57,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:48:57" (3/3) ... [2024-10-11 09:48:57,506 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-24.i [2024-10-11 09:48:57,521 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:48:57,521 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:48:57,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:48:57,589 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;@3b6290b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:48:57,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:48:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 09:48:57,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 09:48:57,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:57,611 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:57,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:57,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:57,616 INFO L85 PathProgramCache]: Analyzing trace with hash -504468667, now seen corresponding path program 1 times [2024-10-11 09:48:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:48:57,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1566315050] [2024-10-11 09:48:57,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:57,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:48:57,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:48:57,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:48:57,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 09:48:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:48:58,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:48:58,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:48:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1006 proven. 0 refuted. 0 times theorem prover too weak. 1514 trivial. 0 not checked. [2024-10-11 09:48:58,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:48:58,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:48:58,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1566315050] [2024-10-11 09:48:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1566315050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:48:58,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:48:58,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:48:58,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269307962] [2024-10-11 09:48:58,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:48:58,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:48:58,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:48:58,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:48:58,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:48:58,257 INFO L87 Difference]: Start difference. First operand has 95 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 09:48:59,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:48:59,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:48:59,687 INFO L93 Difference]: Finished difference Result 186 states and 340 transitions. [2024-10-11 09:48:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:48:59,711 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 221 [2024-10-11 09:48:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:48:59,719 INFO L225 Difference]: With dead ends: 186 [2024-10-11 09:48:59,719 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 09:48:59,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:48:59,726 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:48:59,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 09:48:59,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 09:48:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 09:48:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 09:48:59,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 146 transitions. [2024-10-11 09:48:59,788 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 146 transitions. Word has length 221 [2024-10-11 09:48:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:48:59,789 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 146 transitions. [2024-10-11 09:48:59,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 09:48:59,790 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 146 transitions. [2024-10-11 09:48:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 09:48:59,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:48:59,794 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:48:59,807 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 (2)] Ended with exit code 0 [2024-10-11 09:48:59,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:48:59,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:48:59,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:48:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash 322998853, now seen corresponding path program 1 times [2024-10-11 09:48:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:48:59,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719053088] [2024-10-11 09:48:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:48:59,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:48:59,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:49:00,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:49:00,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 09:49:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:49:00,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 09:49:00,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:49:03,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:49:03,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:49:03,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:49:03,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719053088] [2024-10-11 09:49:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719053088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:49:03,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:49:03,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:49:03,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608228652] [2024-10-11 09:49:03,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:49:03,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:49:03,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:49:03,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:49:03,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:49:03,641 INFO L87 Difference]: Start difference. First operand 92 states and 146 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:49:05,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:49:07,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:49:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:49:07,851 INFO L93 Difference]: Finished difference Result 302 states and 480 transitions. [2024-10-11 09:49:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:49:07,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 221 [2024-10-11 09:49:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:49:07,885 INFO L225 Difference]: With dead ends: 302 [2024-10-11 09:49:07,885 INFO L226 Difference]: Without dead ends: 211 [2024-10-11 09:49:07,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 218 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 09:49:07,888 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 154 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:49:07,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 381 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 09:49:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-11 09:49:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2024-10-11 09:49:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 09:49:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2024-10-11 09:49:07,956 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 221 [2024-10-11 09:49:07,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:49:07,959 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2024-10-11 09:49:07,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:49:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2024-10-11 09:49:07,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 09:49:07,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:49:07,967 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:49:07,988 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 (3)] Forceful destruction successful, exit code 0 [2024-10-11 09:49:08,168 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 09:49:08,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:49:08,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:49:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2124032093, now seen corresponding path program 1 times [2024-10-11 09:49:08,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:49:08,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461358793] [2024-10-11 09:49:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:49:08,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:49:08,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:49:08,174 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 09:49:08,176 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 09:49:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:49:08,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 09:49:08,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:49:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:49:10,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:49:10,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:49:10,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461358793] [2024-10-11 09:49:10,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461358793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:49:10,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:49:10,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:49:10,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278007793] [2024-10-11 09:49:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:49:10,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:49:10,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:49:10,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:49:10,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:49:10,081 INFO L87 Difference]: Start difference. First operand 180 states and 285 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:49:11,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:49:13,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:49:14,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:49:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:49:14,762 INFO L93 Difference]: Finished difference Result 363 states and 575 transitions. [2024-10-11 09:49:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:49:14,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-10-11 09:49:14,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:49:14,792 INFO L225 Difference]: With dead ends: 363 [2024-10-11 09:49:14,792 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 09:49:14,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 219 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 09:49:14,795 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 74 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:49:14,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 415 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 09:49:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 09:49:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 155. [2024-10-11 09:49:14,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 09:49:14,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 244 transitions. [2024-10-11 09:49:14,855 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 244 transitions. Word has length 222 [2024-10-11 09:49:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:49:14,856 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 244 transitions. [2024-10-11 09:49:14,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:49:14,856 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 244 transitions. [2024-10-11 09:49:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 09:49:14,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:49:14,859 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:49:14,879 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 09:49:15,060 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 09:49:15,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:49:15,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:49:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1456156705, now seen corresponding path program 1 times [2024-10-11 09:49:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:49:15,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641280311] [2024-10-11 09:49:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:49:15,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:49:15,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:49:15,069 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 09:49:15,073 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 09:49:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:49:15,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:49:15,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:49:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:49:16,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:49:16,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:49:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641280311] [2024-10-11 09:49:16,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641280311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:49:16,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:49:16,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:49:16,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244036638] [2024-10-11 09:49:16,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:49:16,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:49:16,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:49:16,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:49:16,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:49:16,776 INFO L87 Difference]: Start difference. First operand 155 states and 244 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:49:19,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:49:21,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:49:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:49:21,733 INFO L93 Difference]: Finished difference Result 337 states and 534 transitions. [2024-10-11 09:49:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:49:21,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-10-11 09:49:21,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:49:21,741 INFO L225 Difference]: With dead ends: 337 [2024-10-11 09:49:21,742 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 09:49:21,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:49:21,744 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 42 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-11 09:49:21,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 265 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-11 09:49:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 09:49:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2024-10-11 09:49:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 132 states have internal predecessors, (171), 108 states have call successors, (108), 3 states have call predecessors, (108), 3 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-11 09:49:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 387 transitions. [2024-10-11 09:49:21,798 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 387 transitions. Word has length 222 [2024-10-11 09:49:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:49:21,799 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 387 transitions. [2024-10-11 09:49:21,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:49:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 387 transitions. [2024-10-11 09:49:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 09:49:21,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:49:21,806 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:49:21,826 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 09:49:22,007 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 09:49:22,007 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:49:22,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:49:22,008 INFO L85 PathProgramCache]: Analyzing trace with hash -435088351, now seen corresponding path program 1 times [2024-10-11 09:49:22,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:49:22,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621017917] [2024-10-11 09:49:22,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:49:22,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:49:22,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:49:22,010 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 09:49:22,011 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 09:49:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:49:22,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 09:49:22,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:49:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1139 proven. 33 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2024-10-11 09:49:22,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:49:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 72 proven. 33 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:49:23,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:49:23,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621017917] [2024-10-11 09:49:23,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621017917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:49:23,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:49:23,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 09:49:23,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921231300] [2024-10-11 09:49:23,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:49:23,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:49:23,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:49:23,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:49:23,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:49:23,817 INFO L87 Difference]: Start difference. First operand 244 states and 387 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-11 09:49:26,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:49:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:49:26,257 INFO L93 Difference]: Finished difference Result 442 states and 690 transitions. [2024-10-11 09:49:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:49:26,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 222 [2024-10-11 09:49:26,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:49:26,290 INFO L225 Difference]: With dead ends: 442 [2024-10-11 09:49:26,290 INFO L226 Difference]: Without dead ends: 262 [2024-10-11 09:49:26,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 436 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 09:49:26,292 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 81 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:49:26,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 226 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-11 09:49:26,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-11 09:49:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2024-10-11 09:49:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 141 states have (on average 1.24822695035461) internal successors, (176), 141 states have internal predecessors, (176), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-11 09:49:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 392 transitions. [2024-10-11 09:49:26,348 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 392 transitions. Word has length 222 [2024-10-11 09:49:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:49:26,350 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 392 transitions. [2024-10-11 09:49:26,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-10-11 09:49:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 392 transitions. [2024-10-11 09:49:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 09:49:26,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:49:26,360 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:49:26,381 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 09:49:26,560 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 09:49:26,561 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:49:26,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:49:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1714952029, now seen corresponding path program 1 times [2024-10-11 09:49:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:49:26,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274129899] [2024-10-11 09:49:26,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:49:26,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:49:26,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:49:26,564 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 09:49:26,565 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 09:49:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:49:26,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 09:49:26,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:49:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1289 proven. 48 refuted. 0 times theorem prover too weak. 1183 trivial. 0 not checked. [2024-10-11 09:49:27,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:49:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 57 proven. 48 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:49:28,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:49:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274129899] [2024-10-11 09:49:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274129899] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:49:28,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:49:28,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-11 09:49:28,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676799132] [2024-10-11 09:49:28,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:49:28,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:49:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:49:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:49:28,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:49:28,676 INFO L87 Difference]: Start difference. First operand 256 states and 392 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-10-11 09:49:33,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:49:35,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:49:35,151 INFO L93 Difference]: Finished difference Result 470 states and 706 transitions. [2024-10-11 09:49:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 09:49:35,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 222 [2024-10-11 09:49:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:49:35,156 INFO L225 Difference]: With dead ends: 470 [2024-10-11 09:49:35,156 INFO L226 Difference]: Without dead ends: 282 [2024-10-11 09:49:35,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 436 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-10-11 09:49:35,158 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 247 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:49:35,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 375 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-11 09:49:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-11 09:49:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 268. [2024-10-11 09:49:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 150 states have (on average 1.1933333333333334) internal successors, (179), 150 states have internal predecessors, (179), 108 states have call successors, (108), 9 states have call predecessors, (108), 9 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-11 09:49:35,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 395 transitions. [2024-10-11 09:49:35,194 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 395 transitions. Word has length 222 [2024-10-11 09:49:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:49:35,196 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 395 transitions. [2024-10-11 09:49:35,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-10-11 09:49:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 395 transitions. [2024-10-11 09:49:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 09:49:35,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:49:35,201 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:49:35,221 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 (7)] Ended with exit code 0 [2024-10-11 09:49:35,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:49:35,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:49:35,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:49:35,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1456786591, now seen corresponding path program 1 times [2024-10-11 09:49:35,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:49:35,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10686491] [2024-10-11 09:49:35,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:49:35,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:49:35,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:49:35,407 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:49:35,408 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 (8)] Waiting until timeout for monitored process [2024-10-11 09:49:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:49:35,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 09:49:35,786 INFO L278 TraceCheckSpWp]: Computing forward predicates...