./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-78.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:52:13,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:52:13,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:52:13,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:52:13,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:52:13,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:52:13,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:52:13,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:52:13,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:52:13,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:52:13,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:52:13,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:52:13,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:52:13,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:52:13,129 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:52:13,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:52:13,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:52:13,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:52:13,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:52:13,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:52:13,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:52:13,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:52:13,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:52:13,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:52:13,135 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:52:13,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:52:13,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:52:13,136 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:52:13,136 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:52:13,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:52:13,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:52:13,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:52:13,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:52:13,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:52:13,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:52:13,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:52:13,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:52:13,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:52:13,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:52:13,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:52:13,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:52:13,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:52:13,141 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 [2024-11-08 22:52:13,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:52:13,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:52:13,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:52:13,408 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:52:13,408 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:52:13,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-78.i [2024-11-08 22:52:14,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:52:15,131 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:52:15,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-78.i [2024-11-08 22:52:15,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f329f5e7/38df3dc7d4774762bfbbe5cf37787601/FLAG79bd34566 [2024-11-08 22:52:15,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f329f5e7/38df3dc7d4774762bfbbe5cf37787601 [2024-11-08 22:52:15,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:52:15,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:52:15,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:52:15,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:52:15,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:52:15,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe47731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15, skipping insertion in model container [2024-11-08 22:52:15,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:52:15,494 WARN L250 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_normal_file-78.i[913,926] [2024-11-08 22:52:15,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:52:15,603 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:52:15,615 WARN L250 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_normal_file-78.i[913,926] [2024-11-08 22:52:15,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:52:15,672 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:52:15,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15 WrapperNode [2024-11-08 22:52:15,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:52:15,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:52:15,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:52:15,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:52:15,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,742 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-08 22:52:15,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:52:15,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:52:15,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:52:15,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:52:15,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,790 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-11-08 22:52:15,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:52:15,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:52:15,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:52:15,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:52:15,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (1/1) ... [2024-11-08 22:52:15,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:52:15,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:52:15,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:52:15,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:52:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:52:15,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:52:15,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:52:15,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:52:15,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:52:15,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:52:15,998 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:52:16,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:52:16,468 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 22:52:16,468 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:52:16,485 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:52:16,486 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:52:16,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:52:16 BoogieIcfgContainer [2024-11-08 22:52:16,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:52:16,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:52:16,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:52:16,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:52:16,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:52:15" (1/3) ... [2024-11-08 22:52:16,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41197ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:52:16, skipping insertion in model container [2024-11-08 22:52:16,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:15" (2/3) ... [2024-11-08 22:52:16,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41197ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:52:16, skipping insertion in model container [2024-11-08 22:52:16,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:52:16" (3/3) ... [2024-11-08 22:52:16,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-78.i [2024-11-08 22:52:16,510 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:52:16,510 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:52:16,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:52:16,601 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;@20fb5bcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:52:16,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:52:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 22:52:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 22:52:16,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:16,624 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:16,624 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:16,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:16,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1081327444, now seen corresponding path program 1 times [2024-11-08 22:52:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:52:16,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320663632] [2024-11-08 22:52:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:16,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:52:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:16,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:52:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:16,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:52:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:16,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:52:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:16,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:52:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:52:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:52:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:52:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:52:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:52:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:52:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:52:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:52:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:52:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:52:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:52:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:52:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:52:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:52:17,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:52:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320663632] [2024-11-08 22:52:17,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320663632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:17,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:17,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:52:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393660380] [2024-11-08 22:52:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:17,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:52:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:52:17,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:52:17,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:52:17,126 INFO L87 Difference]: Start difference. First operand has 78 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:52:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:17,154 INFO L93 Difference]: Finished difference Result 149 states and 246 transitions. [2024-11-08 22:52:17,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:52:17,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-11-08 22:52:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:17,162 INFO L225 Difference]: With dead ends: 149 [2024-11-08 22:52:17,162 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 22:52:17,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-11-08 22:52:17,169 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:17,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:52:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 22:52:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-08 22:52:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 22:52:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2024-11-08 22:52:17,208 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 124 [2024-11-08 22:52:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:17,208 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions. [2024-11-08 22:52:17,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:52:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2024-11-08 22:52:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 22:52:17,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:17,212 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:17,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:52:17,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:17,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1852945056, now seen corresponding path program 1 times [2024-11-08 22:52:17,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:52:17,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614801207] [2024-11-08 22:52:17,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:17,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:52:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:52:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:52:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:52:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:52:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:52:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:52:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:52:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:52:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:52:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:52:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:52:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:52:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:52:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:52:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:52:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:52:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:52:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:52:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:52:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614801207] [2024-11-08 22:52:17,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614801207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:17,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:52:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668268217] [2024-11-08 22:52:17,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:17,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:52:17,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:52:17,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:52:17,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:52:17,615 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:17,658 INFO L93 Difference]: Finished difference Result 145 states and 217 transitions. [2024-11-08 22:52:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:52:17,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2024-11-08 22:52:17,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:17,662 INFO L225 Difference]: With dead ends: 145 [2024-11-08 22:52:17,663 INFO L226 Difference]: Without dead ends: 74 [2024-11-08 22:52:17,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:52:17,666 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:17,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 313 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:52:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-08 22:52:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-08 22:52:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 22:52:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2024-11-08 22:52:17,682 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 124 [2024-11-08 22:52:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:17,684 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2024-11-08 22:52:17,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2024-11-08 22:52:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 22:52:17,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:17,688 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:17,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:52:17,688 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:17,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash -112637507, now seen corresponding path program 1 times [2024-11-08 22:52:17,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:52:17,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742935292] [2024-11-08 22:52:17,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:17,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:52:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:52:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:52:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:52:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:52:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:52:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:52:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:52:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:52:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:52:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:52:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:52:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:52:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:52:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:52:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:52:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:52:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:52:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:52:18,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:52:18,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742935292] [2024-11-08 22:52:18,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742935292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:18,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:18,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:52:18,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275875618] [2024-11-08 22:52:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:18,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:52:18,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:52:18,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:52:18,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:52:18,135 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:18,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:18,343 INFO L93 Difference]: Finished difference Result 217 states and 322 transitions. [2024-11-08 22:52:18,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:52:18,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-11-08 22:52:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:18,350 INFO L225 Difference]: With dead ends: 217 [2024-11-08 22:52:18,350 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 22:52:18,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-11-08 22:52:18,356 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 84 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:18,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 284 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:52:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 22:52:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 129. [2024-11-08 22:52:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 22:52:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 192 transitions. [2024-11-08 22:52:18,380 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 192 transitions. Word has length 125 [2024-11-08 22:52:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:18,381 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 192 transitions. [2024-11-08 22:52:18,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 192 transitions. [2024-11-08 22:52:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 22:52:18,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:18,383 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:18,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:52:18,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:18,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2070223852, now seen corresponding path program 1 times [2024-11-08 22:52:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:52:18,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308176014] [2024-11-08 22:52:18,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:52:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:52:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:52:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:52:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:52:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:52:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:52:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:52:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:52:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:52:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:52:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:52:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:52:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:52:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:52:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:52:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:52:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:52:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:52:18,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:52:18,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308176014] [2024-11-08 22:52:18,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308176014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:18,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:18,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:52:18,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278580581] [2024-11-08 22:52:18,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:18,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:52:18,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:52:18,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:52:18,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:52:18,676 INFO L87 Difference]: Start difference. First operand 129 states and 192 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:18,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:18,846 INFO L93 Difference]: Finished difference Result 309 states and 458 transitions. [2024-11-08 22:52:18,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:52:18,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-11-08 22:52:18,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:18,850 INFO L225 Difference]: With dead ends: 309 [2024-11-08 22:52:18,850 INFO L226 Difference]: Without dead ends: 223 [2024-11-08 22:52:18,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-11-08 22:52:18,856 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 122 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:18,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 311 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:52:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-08 22:52:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 205. [2024-11-08 22:52:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 147 states have internal predecessors, (196), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 22:52:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 304 transitions. [2024-11-08 22:52:18,906 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 304 transitions. Word has length 126 [2024-11-08 22:52:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:18,907 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 304 transitions. [2024-11-08 22:52:18,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 304 transitions. [2024-11-08 22:52:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 22:52:18,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:18,910 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:18,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:52:18,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:18,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash 329054776, now seen corresponding path program 1 times [2024-11-08 22:52:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:52:18,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428808848] [2024-11-08 22:52:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:52:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:52:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:52:19,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:52:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:52:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:52:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:52:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:52:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:52:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:52:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:52:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:52:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:52:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:52:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:52:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:52:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:52:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:52:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:52:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:52:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428808848] [2024-11-08 22:52:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428808848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:19,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:19,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 22:52:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885541375] [2024-11-08 22:52:19,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:19,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 22:52:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:52:19,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 22:52:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:52:19,233 INFO L87 Difference]: Start difference. First operand 205 states and 304 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:19,506 INFO L93 Difference]: Finished difference Result 582 states and 855 transitions. [2024-11-08 22:52:19,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 22:52:19,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-08 22:52:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:19,510 INFO L225 Difference]: With dead ends: 582 [2024-11-08 22:52:19,510 INFO L226 Difference]: Without dead ends: 431 [2024-11-08 22:52:19,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-08 22:52:19,516 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 265 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:19,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 621 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:52:19,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-08 22:52:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 365. [2024-11-08 22:52:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 269 states have (on average 1.3531598513011152) internal successors, (364), 269 states have internal predecessors, (364), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 22:52:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 544 transitions. [2024-11-08 22:52:19,575 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 544 transitions. Word has length 127 [2024-11-08 22:52:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:19,576 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 544 transitions. [2024-11-08 22:52:19,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 544 transitions. [2024-11-08 22:52:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 22:52:19,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:19,579 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:19,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:52:19,579 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:19,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:19,580 INFO L85 PathProgramCache]: Analyzing trace with hash -63972234, now seen corresponding path program 1 times [2024-11-08 22:52:19,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:52:19,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605151323] [2024-11-08 22:52:19,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:19,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:52:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:52:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:52:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:52:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:52:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:52:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:52:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:52:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:52:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:52:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:52:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:52:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:52:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:52:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:52:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:52:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:52:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:52:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:52:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:52:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605151323] [2024-11-08 22:52:19,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605151323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:19,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:19,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:52:19,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549591642] [2024-11-08 22:52:19,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:19,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:52:19,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:52:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:52:19,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:52:19,976 INFO L87 Difference]: Start difference. First operand 365 states and 544 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:20,175 INFO L93 Difference]: Finished difference Result 749 states and 1107 transitions. [2024-11-08 22:52:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:52:20,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-08 22:52:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:20,181 INFO L225 Difference]: With dead ends: 749 [2024-11-08 22:52:20,181 INFO L226 Difference]: Without dead ends: 427 [2024-11-08 22:52:20,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-11-08 22:52:20,184 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 76 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:20,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 284 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:52:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-08 22:52:20,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 373. [2024-11-08 22:52:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 22:52:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 551 transitions. [2024-11-08 22:52:20,234 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 551 transitions. Word has length 127 [2024-11-08 22:52:20,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:20,235 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 551 transitions. [2024-11-08 22:52:20,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 551 transitions. [2024-11-08 22:52:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 22:52:20,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:20,236 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:20,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:52:20,237 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:20,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:20,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1196855801, now seen corresponding path program 1 times [2024-11-08 22:52:20,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:52:20,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272106268] [2024-11-08 22:52:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:20,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:52:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:52:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:52:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:52:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:52:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:52:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:52:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:52:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:52:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:52:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:52:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:52:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:52:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:52:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:52:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:52:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:52:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:52:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:52:20,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:52:20,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272106268] [2024-11-08 22:52:20,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272106268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:20,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:20,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:52:20,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125915773] [2024-11-08 22:52:20,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:20,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:52:20,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:52:20,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:52:20,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:52:20,643 INFO L87 Difference]: Start difference. First operand 373 states and 551 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:20,881 INFO L93 Difference]: Finished difference Result 948 states and 1396 transitions. [2024-11-08 22:52:20,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:52:20,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-11-08 22:52:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:20,887 INFO L225 Difference]: With dead ends: 948 [2024-11-08 22:52:20,887 INFO L226 Difference]: Without dead ends: 614 [2024-11-08 22:52:20,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:52:20,889 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 127 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:20,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 447 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:52:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-11-08 22:52:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 526. [2024-11-08 22:52:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 392 states have (on average 1.336734693877551) internal successors, (524), 392 states have internal predecessors, (524), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-08 22:52:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 776 transitions. [2024-11-08 22:52:20,955 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 776 transitions. Word has length 128 [2024-11-08 22:52:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:20,955 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 776 transitions. [2024-11-08 22:52:20,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 776 transitions. [2024-11-08 22:52:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 22:52:20,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:20,958 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:20,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:52:20,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:20,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash -978001083, now seen corresponding path program 1 times [2024-11-08 22:52:20,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:52:20,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422818155] [2024-11-08 22:52:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:52:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:52:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:52:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:52:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:52:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:52:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:52:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:52:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:52:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:52:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:52:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:52:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:52:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:52:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:52:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:52:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:52:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:52:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:52:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:52:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422818155] [2024-11-08 22:52:21,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422818155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:21,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:21,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 22:52:21,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123913025] [2024-11-08 22:52:21,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:21,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 22:52:21,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:52:21,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 22:52:21,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:52:21,266 INFO L87 Difference]: Start difference. First operand 526 states and 776 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:21,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:21,491 INFO L93 Difference]: Finished difference Result 1104 states and 1638 transitions. [2024-11-08 22:52:21,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 22:52:21,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-11-08 22:52:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:21,496 INFO L225 Difference]: With dead ends: 1104 [2024-11-08 22:52:21,496 INFO L226 Difference]: Without dead ends: 674 [2024-11-08 22:52:21,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:52:21,499 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 40 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:21,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 490 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:52:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-08 22:52:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 604. [2024-11-08 22:52:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 470 states have (on average 1.3425531914893618) internal successors, (631), 470 states have internal predecessors, (631), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-08 22:52:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 883 transitions. [2024-11-08 22:52:21,555 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 883 transitions. Word has length 128 [2024-11-08 22:52:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:21,556 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 883 transitions. [2024-11-08 22:52:21,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 883 transitions. [2024-11-08 22:52:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 22:52:21,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:21,558 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 22:52:21,558 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1008502880, now seen corresponding path program 1 times [2024-11-08 22:52:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:52:21,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906877352] [2024-11-08 22:52:21,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:52:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386537941] [2024-11-08 22:52:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:21,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:52:21,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:52:21,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:52:21,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:52:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:22,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 22:52:22,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:52:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-08 22:52:22,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:52:23,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:52:23,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906877352] [2024-11-08 22:52:23,417 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 22:52:23,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386537941] [2024-11-08 22:52:23,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386537941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:52:23,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 22:52:23,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-08 22:52:23,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554543351] [2024-11-08 22:52:23,418 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 22:52:23,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 22:52:23,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:52:23,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 22:52:23,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-08 22:52:23,420 INFO L87 Difference]: Start difference. First operand 604 states and 883 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:52:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:24,056 INFO L93 Difference]: Finished difference Result 1461 states and 2091 transitions. [2024-11-08 22:52:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 22:52:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2024-11-08 22:52:24,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:24,063 INFO L225 Difference]: With dead ends: 1461 [2024-11-08 22:52:24,063 INFO L226 Difference]: Without dead ends: 1078 [2024-11-08 22:52:24,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-08 22:52:24,067 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 153 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:24,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 429 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:52:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-11-08 22:52:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1034. [2024-11-08 22:52:24,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 804 states have (on average 1.3258706467661692) internal successors, (1066), 808 states have internal predecessors, (1066), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-11-08 22:52:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1478 transitions. [2024-11-08 22:52:24,151 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1478 transitions. Word has length 133 [2024-11-08 22:52:24,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:24,151 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1478 transitions. [2024-11-08 22:52:24,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:52:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1478 transitions. [2024-11-08 22:52:24,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 22:52:24,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:24,153 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:24,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:52:24,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:52:24,358 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:24,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:24,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1470718108, now seen corresponding path program 1 times [2024-11-08 22:52:24,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:52:24,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040961915] [2024-11-08 22:52:24,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:24,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:52:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:52:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:52:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:52:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:52:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:52:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:52:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:52:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:52:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 22:52:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 22:52:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 22:52:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 22:52:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 22:52:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 22:52:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 22:52:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 22:52:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 22:52:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:52:24,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:52:24,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040961915] [2024-11-08 22:52:24,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040961915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:24,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:24,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:52:24,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110733939] [2024-11-08 22:52:24,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:24,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:52:24,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:52:24,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:52:24,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:52:24,589 INFO L87 Difference]: Start difference. First operand 1034 states and 1478 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:24,755 INFO L93 Difference]: Finished difference Result 1790 states and 2584 transitions. [2024-11-08 22:52:24,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:52:24,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 133 [2024-11-08 22:52:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:24,770 INFO L225 Difference]: With dead ends: 1790 [2024-11-08 22:52:24,771 INFO L226 Difference]: Without dead ends: 1375 [2024-11-08 22:52:24,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:52:24,774 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 69 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:24,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 431 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:52:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-08 22:52:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1037. [2024-11-08 22:52:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 807 states have (on average 1.3246592317224288) internal successors, (1069), 811 states have internal predecessors, (1069), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-11-08 22:52:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1481 transitions. [2024-11-08 22:52:24,880 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1481 transitions. Word has length 133 [2024-11-08 22:52:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:24,882 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1481 transitions. [2024-11-08 22:52:24,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1481 transitions. [2024-11-08 22:52:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 22:52:24,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:24,885 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:24,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 22:52:24,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:24,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash 190854430, now seen corresponding path program 1 times [2024-11-08 22:52:24,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:52:24,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301145617] [2024-11-08 22:52:24,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:24,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:52:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:52:24,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274367038] [2024-11-08 22:52:24,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:24,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:52:24,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:52:24,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:52:24,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 22:52:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:52:25,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:52:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:52:25,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:52:25,415 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:52:25,416 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:52:25,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 22:52:25,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 22:52:25,621 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:52:25,724 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:52:25,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:52:25 BoogieIcfgContainer [2024-11-08 22:52:25,727 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:52:25,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:52:25,728 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:52:25,728 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:52:25,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:52:16" (3/4) ... [2024-11-08 22:52:25,731 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:52:25,732 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:52:25,732 INFO L158 Benchmark]: Toolchain (without parser) took 10561.73ms. Allocated memory was 148.9MB in the beginning and 310.4MB in the end (delta: 161.5MB). Free memory was 77.9MB in the beginning and 146.3MB in the end (delta: -68.4MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2024-11-08 22:52:25,733 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 148.9MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:52:25,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.24ms. Allocated memory is still 148.9MB. Free memory was 77.7MB in the beginning and 106.9MB in the end (delta: -29.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-11-08 22:52:25,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.47ms. Allocated memory is still 148.9MB. Free memory was 106.9MB in the beginning and 99.7MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:52:25,733 INFO L158 Benchmark]: Boogie Preprocessor took 75.63ms. Allocated memory is still 148.9MB. Free memory was 99.7MB in the beginning and 88.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 22:52:25,734 INFO L158 Benchmark]: RCFGBuilder took 667.11ms. Allocated memory is still 148.9MB. Free memory was 88.5MB in the beginning and 56.6MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-08 22:52:25,734 INFO L158 Benchmark]: TraceAbstraction took 9238.49ms. Allocated memory was 148.9MB in the beginning and 310.4MB in the end (delta: 161.5MB). Free memory was 56.1MB in the beginning and 146.3MB in the end (delta: -90.2MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. [2024-11-08 22:52:25,734 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 310.4MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:52:25,736 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.22ms. Allocated memory is still 148.9MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.24ms. Allocated memory is still 148.9MB. Free memory was 77.7MB in the beginning and 106.9MB in the end (delta: -29.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.47ms. Allocated memory is still 148.9MB. Free memory was 106.9MB in the beginning and 99.7MB in the end (delta: 7.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.63ms. Allocated memory is still 148.9MB. Free memory was 99.7MB in the beginning and 88.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 667.11ms. Allocated memory is still 148.9MB. Free memory was 88.5MB in the beginning and 56.6MB in the end (delta: 31.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9238.49ms. Allocated memory was 148.9MB in the beginning and 310.4MB in the end (delta: 161.5MB). Free memory was 56.1MB in the beginning and 146.3MB in the end (delta: -90.2MB). Peak memory consumption was 73.2MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 310.4MB. Free memory is still 146.3MB. 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 119, overapproximation of bitwiseOr at line 119, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char last_1_var_1_3 = 64; [L42] unsigned short int last_1_var_1_6 = 10; [L43] unsigned short int last_1_var_1_15 = 5; [L44] unsigned short int last_1_var_1_20 = 50; [L45] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L112] last_1_var_1_3 = var_1_3 [L113] last_1_var_1_6 = var_1_6 [L114] last_1_var_1_15 = var_1_15 [L115] last_1_var_1_20 = var_1_20 [L116] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L126] RET updateLastVariables() [L127] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L87] var_1_9 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L88] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L91] var_1_10 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L92] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L93] var_1_11 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L94] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L95] var_1_12 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L97] var_1_13 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L99] var_1_14 = __VERIFIER_nondet_double() [L100] 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_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L100] 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_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] var_1_17 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L102] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L104] var_1_18 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L105] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L107] var_1_19 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L108] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L127] RET updateVariables() [L128] CALL step() [L49] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L50] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L53] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L53] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L54] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L55] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L58] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L62] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L63] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L64] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L70] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L71] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L72] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L73] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L73] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L76] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L77] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119-L120] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 940 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 936 mSDsluCounter, 3720 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2582 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 762 IncrementalHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 1138 mSDtfsCounter, 762 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 570 GetRequests, 516 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1037occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 695 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1674 NumberOfCodeBlocks, 1674 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1265 ConstructedInterpolants, 0 QuantifiedInterpolants, 3936 SizeOfPredicates, 4 NumberOfNonLiveVariables, 322 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6078/6120 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-11-08 22:52:25,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-78.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:52:27,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:52:27,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:52:27,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:52:27,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:52:28,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:52:28,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:52:28,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:52:28,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:52:28,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:52:28,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:52:28,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:52:28,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:52:28,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:52:28,019 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:52:28,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:52:28,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:52:28,021 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:52:28,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:52:28,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:52:28,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:52:28,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:52:28,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:52:28,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:52:28,024 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:52:28,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:52:28,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:52:28,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:52:28,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:52:28,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:52:28,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:52:28,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:52:28,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:52:28,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:52:28,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:52:28,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:52:28,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:52:28,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:52:28,029 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:52:28,029 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:52:28,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:52:28,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:52:28,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:52:28,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:52:28,031 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ad013cbadddcdab90e1c66c7d22e00582a9c9a3cc34003c3bfa5d26a4373bc2 [2024-11-08 22:52:28,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:52:28,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:52:28,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:52:28,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:52:28,395 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:52:28,396 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-78.i [2024-11-08 22:52:29,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:52:30,110 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:52:30,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-78.i [2024-11-08 22:52:30,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a45b3e04/a3d16b68871042d1a47fb75ac702ca05/FLAGf74b350f9 [2024-11-08 22:52:30,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a45b3e04/a3d16b68871042d1a47fb75ac702ca05 [2024-11-08 22:52:30,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:52:30,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:52:30,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:52:30,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:52:30,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:52:30,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f08351c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30, skipping insertion in model container [2024-11-08 22:52:30,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:52:30,379 WARN L250 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_normal_file-78.i[913,926] [2024-11-08 22:52:30,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:52:30,480 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:52:30,492 WARN L250 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_normal_file-78.i[913,926] [2024-11-08 22:52:30,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:52:30,545 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:52:30,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30 WrapperNode [2024-11-08 22:52:30,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:52:30,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:52:30,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:52:30,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:52:30,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,572 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,620 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-11-08 22:52:30,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:52:30,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:52:30,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:52:30,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:52:30,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,675 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-11-08 22:52:30,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:52:30,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:52:30,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:52:30,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:52:30,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (1/1) ... [2024-11-08 22:52:30,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:52:30,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:52:30,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:52:30,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:52:30,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:52:30,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:52:30,787 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:52:30,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:52:30,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:52:30,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:52:30,864 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:52:30,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:52:36,201 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 22:52:36,204 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:52:36,218 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:52:36,218 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:52:36,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:52:36 BoogieIcfgContainer [2024-11-08 22:52:36,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:52:36,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:52:36,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:52:36,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:52:36,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:52:30" (1/3) ... [2024-11-08 22:52:36,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0deff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:52:36, skipping insertion in model container [2024-11-08 22:52:36,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:52:30" (2/3) ... [2024-11-08 22:52:36,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0deff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:52:36, skipping insertion in model container [2024-11-08 22:52:36,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:52:36" (3/3) ... [2024-11-08 22:52:36,227 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-78.i [2024-11-08 22:52:36,244 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:52:36,244 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:52:36,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:52:36,319 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;@385666ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:52:36,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:52:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 22:52:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 22:52:36,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:36,339 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:36,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:36,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:36,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1002863956, now seen corresponding path program 1 times [2024-11-08 22:52:36,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:52:36,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214635092] [2024-11-08 22:52:36,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:36,364 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-11-08 22:52:36,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:52:36,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:52:36,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 22:52:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:36,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:52:36,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:52:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-08 22:52:36,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:52:36,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:52:36,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214635092] [2024-11-08 22:52:36,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214635092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:36,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:36,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:52:36,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914509918] [2024-11-08 22:52:36,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:36,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:52:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:52:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:52:36,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:52:36,922 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:52:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:36,951 INFO L93 Difference]: Finished difference Result 109 states and 182 transitions. [2024-11-08 22:52:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:52:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2024-11-08 22:52:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:36,968 INFO L225 Difference]: With dead ends: 109 [2024-11-08 22:52:36,968 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 22:52:36,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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-11-08 22:52:36,974 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:36,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:52:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 22:52:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 22:52:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 22:52:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-11-08 22:52:37,018 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 118 [2024-11-08 22:52:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:37,019 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-11-08 22:52:37,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 22:52:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-11-08 22:52:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 22:52:37,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:37,023 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:37,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:52:37,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:52:37,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:37,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -550009760, now seen corresponding path program 1 times [2024-11-08 22:52:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:52:37,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369078004] [2024-11-08 22:52:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:37,227 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-11-08 22:52:37,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:52:37,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:52:37,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 22:52:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:37,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 22:52:37,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:52:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:52:39,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:52:39,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:52:39,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369078004] [2024-11-08 22:52:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369078004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:39,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:39,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:52:39,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639565906] [2024-11-08 22:52:39,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:39,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:52:39,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:52:39,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:52:39,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:52:39,986 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:43,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:52:47,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:52:49,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:52:52,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:52:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:52,326 INFO L93 Difference]: Finished difference Result 169 states and 245 transitions. [2024-11-08 22:52:52,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:52:52,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-08 22:52:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:52,364 INFO L225 Difference]: With dead ends: 169 [2024-11-08 22:52:52,364 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 22:52:52,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:52:52,366 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 60 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:52,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 268 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 12.1s Time] [2024-11-08 22:52:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 22:52:52,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2024-11-08 22:52:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.234375) internal successors, (79), 64 states have internal predecessors, (79), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 22:52:52,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2024-11-08 22:52:52,397 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 118 [2024-11-08 22:52:52,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:52,398 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2024-11-08 22:52:52,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2024-11-08 22:52:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 22:52:52,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:52,400 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:52,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 22:52:52,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:52:52,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:52,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash -291844322, now seen corresponding path program 1 times [2024-11-08 22:52:52,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:52:52,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319032201] [2024-11-08 22:52:52,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:52,603 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-11-08 22:52:52,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:52:52,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:52:52,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 22:52:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:52,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:52:52,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:52:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:52:53,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:52:53,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:52:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319032201] [2024-11-08 22:52:53,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319032201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:52:53,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:52:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:52:53,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828303892] [2024-11-08 22:52:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:52:53,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:52:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:52:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:52:53,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:52:53,059 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:57,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 22:52:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:52:57,220 INFO L93 Difference]: Finished difference Result 154 states and 226 transitions. [2024-11-08 22:52:57,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:52:57,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-08 22:52:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:52:57,256 INFO L225 Difference]: With dead ends: 154 [2024-11-08 22:52:57,256 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 22:52:57,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 116 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-11-08 22:52:57,258 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:52:57,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 22:52:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 22:52:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-08 22:52:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 22:52:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-11-08 22:52:57,288 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 118 [2024-11-08 22:52:57,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:52:57,289 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-11-08 22:52:57,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:52:57,290 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-11-08 22:52:57,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 22:52:57,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:52:57,294 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:52:57,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 22:52:57,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:52:57,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:52:57,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:52:57,496 INFO L85 PathProgramCache]: Analyzing trace with hash -903940054, now seen corresponding path program 1 times [2024-11-08 22:52:57,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:52:57,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384310253] [2024-11-08 22:52:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:52:57,497 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-11-08 22:52:57,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:52:57,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:52:57,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 22:52:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:52:58,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 22:52:58,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:53:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-08 22:53:00,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:53:03,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:53:03,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384310253] [2024-11-08 22:53:03,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384310253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:53:03,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1950005044] [2024-11-08 22:53:03,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:03,731 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 22:53:03,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 22:53:03,735 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 22:53:03,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 22:53:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:04,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:53:04,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:53:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-08 22:53:05,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:53:05,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1950005044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:53:05,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 22:53:05,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-08 22:53:05,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823538910] [2024-11-08 22:53:05,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:53:05,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:53:05,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:53:05,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:53:05,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 22:53:05,843 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:53:08,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:53:13,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:53:14,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:53:19,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 22:53:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:53:19,210 INFO L93 Difference]: Finished difference Result 235 states and 333 transitions. [2024-11-08 22:53:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:53:19,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-08 22:53:19,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:53:19,215 INFO L225 Difference]: With dead ends: 235 [2024-11-08 22:53:19,215 INFO L226 Difference]: Without dead ends: 184 [2024-11-08 22:53:19,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-08 22:53:19,219 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:53:19,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 199 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 1 Unknown, 0 Unchecked, 13.3s Time] [2024-11-08 22:53:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-08 22:53:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 178. [2024-11-08 22:53:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 114 states have (on average 1.2105263157894737) internal successors, (138), 116 states have internal predecessors, (138), 58 states have call successors, (58), 5 states have call predecessors, (58), 5 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 22:53:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 254 transitions. [2024-11-08 22:53:19,247 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 254 transitions. Word has length 119 [2024-11-08 22:53:19,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:53:19,248 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 254 transitions. [2024-11-08 22:53:19,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 22:53:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2024-11-08 22:53:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 22:53:19,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:53:19,250 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:53:19,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 22:53:19,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-08 22:53:19,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 22:53:19,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:53:19,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:53:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1296967064, now seen corresponding path program 1 times [2024-11-08 22:53:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:53:19,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433365805] [2024-11-08 22:53:19,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:53:19,653 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-11-08 22:53:19,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:53:19,654 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:53:19,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 22:53:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:53:20,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-08 22:53:20,395 INFO L278 TraceCheckSpWp]: Computing forward predicates...