./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.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 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:50:54,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:50:54,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:50:54,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:50:54,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:50:54,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:50:54,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:50:54,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:50:54,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:50:54,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:50:54,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:50:54,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:50:54,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:50:54,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:50:54,879 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:50:54,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:50:54,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:50:54,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:50:54,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:50:54,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:50:54,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:50:54,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:50:54,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:50:54,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:50:54,883 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:50:54,883 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:50:54,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:50:54,884 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:50:54,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:50:54,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:50:54,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:50:54,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:50:54,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:50:54,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:50:54,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:50:54,886 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:50:54,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:50:54,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:50:54,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:50:54,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:50:54,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:50:54,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:50:54,888 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 -> 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc [2024-10-24 06:50:55,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:50:55,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:50:55,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:50:55,156 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:50:55,157 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:50:55,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-10-24 06:50:56,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:50:56,941 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:50:56,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-10-24 06:50:56,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c40c92a7/38355daa1ded4946899b8bd3e220cbc7/FLAG46bd75617 [2024-10-24 06:50:56,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c40c92a7/38355daa1ded4946899b8bd3e220cbc7 [2024-10-24 06:50:56,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:50:56,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:50:56,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:50:56,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:50:56,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:50:56,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:50:56" (1/1) ... [2024-10-24 06:50:56,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70718559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:56, skipping insertion in model container [2024-10-24 06:50:56,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:50:56" (1/1) ... [2024-10-24 06:50:57,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:50:57,218 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i[918,931] [2024-10-24 06:50:57,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:50:57,323 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:50:57,335 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i[918,931] [2024-10-24 06:50:57,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:50:57,408 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:50:57,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57 WrapperNode [2024-10-24 06:50:57,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:50:57,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:50:57,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:50:57,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:50:57,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,470 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-10-24 06:50:57,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:50:57,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:50:57,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:50:57,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:50:57,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,525 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:50:57,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:50:57,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:50:57,552 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:50:57,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:50:57,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (1/1) ... [2024-10-24 06:50:57,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:50:57,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:50:57,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:50:57,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:50:57,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:50:57,642 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:50:57,642 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:50:57,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:50:57,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:50:57,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:50:57,729 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:50:57,731 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:50:58,245 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:50:58,246 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:50:58,289 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:50:58,289 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:50:58,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:50:58 BoogieIcfgContainer [2024-10-24 06:50:58,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:50:58,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:50:58,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:50:58,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:50:58,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:50:56" (1/3) ... [2024-10-24 06:50:58,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4240ed7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:50:58, skipping insertion in model container [2024-10-24 06:50:58,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:50:57" (2/3) ... [2024-10-24 06:50:58,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4240ed7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:50:58, skipping insertion in model container [2024-10-24 06:50:58,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:50:58" (3/3) ... [2024-10-24 06:50:58,301 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-10-24 06:50:58,319 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:50:58,319 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:50:58,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:50:58,393 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;@e988760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:50:58,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:50:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 57 states have internal predecessors, (85), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:50:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 06:50:58,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:50:58,412 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:50:58,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:50:58,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:50:58,417 INFO L85 PathProgramCache]: Analyzing trace with hash -231297060, now seen corresponding path program 1 times [2024-10-24 06:50:58,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:50:58,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031474450] [2024-10-24 06:50:58,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:50:58,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:50:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:50:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:50:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:50:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:50:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:50:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:50:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:50:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:50:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:50:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:50:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:50:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:50:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:50:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:50:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:50:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:50:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:50:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:50:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:50:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:50:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:50:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:50:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:50:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:50:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:50:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:50:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:50:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:50:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:50:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:50:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:50:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:50:58,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:50:58,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031474450] [2024-10-24 06:50:58,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031474450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:50:58,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:50:58,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:50:58,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520714003] [2024-10-24 06:50:58,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:50:58,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:50:58,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:50:58,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:50:58,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:50:58,995 INFO L87 Difference]: Start difference. First operand has 90 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 57 states have internal predecessors, (85), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:50:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:50:59,054 INFO L93 Difference]: Finished difference Result 177 states and 323 transitions. [2024-10-24 06:50:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:50:59,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 195 [2024-10-24 06:50:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:50:59,068 INFO L225 Difference]: With dead ends: 177 [2024-10-24 06:50:59,069 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 06:50:59,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:50:59,080 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:50:59,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:50:59,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 06:50:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 06:50:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:50:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 141 transitions. [2024-10-24 06:50:59,138 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 141 transitions. Word has length 195 [2024-10-24 06:50:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:50:59,139 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 141 transitions. [2024-10-24 06:50:59,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:50:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 141 transitions. [2024-10-24 06:50:59,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 06:50:59,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:50:59,144 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:50:59,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:50:59,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:50:59,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:50:59,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1817803746, now seen corresponding path program 1 times [2024-10-24 06:50:59,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:50:59,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555668635] [2024-10-24 06:50:59,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:50:59,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:50:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:50:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:50:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:50:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:50:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:50:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:50:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:50:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:50:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:50:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:50:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:50:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:50:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:50:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:50:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:50:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:50:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:50:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:50:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:50:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:50:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:50:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:50:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:50:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:50:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:50:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:50:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:50:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:50:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:50:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:50:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:50:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:50:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:50:59,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:50:59,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555668635] [2024-10-24 06:50:59,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555668635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:50:59,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:50:59,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:50:59,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637825190] [2024-10-24 06:50:59,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:50:59,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:50:59,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:50:59,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:50:59,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:50:59,721 INFO L87 Difference]: Start difference. First operand 88 states and 141 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:50:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:50:59,955 INFO L93 Difference]: Finished difference Result 219 states and 349 transitions. [2024-10-24 06:50:59,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:50:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-10-24 06:50:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:50:59,959 INFO L225 Difference]: With dead ends: 219 [2024-10-24 06:50:59,959 INFO L226 Difference]: Without dead ends: 132 [2024-10-24 06:50:59,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 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-10-24 06:50:59,962 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 64 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:50:59,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 344 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:50:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-24 06:50:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2024-10-24 06:50:59,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 83 states have internal predecessors, (118), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 06:50:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 206 transitions. [2024-10-24 06:50:59,996 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 206 transitions. Word has length 195 [2024-10-24 06:50:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:50:59,999 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 206 transitions. [2024-10-24 06:50:59,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:50:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 206 transitions. [2024-10-24 06:51:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 06:51:00,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:00,005 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:00,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:51:00,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:00,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:00,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1116739168, now seen corresponding path program 1 times [2024-10-24 06:51:00,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:00,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282098135] [2024-10-24 06:51:00,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:00,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:51:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:51:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:51:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:51:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:51:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:51:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:51:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:51:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:51:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:51:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:51:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:51:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:51:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:51:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:51:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:51:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:51:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:51:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:51:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:51:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:51:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:51:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:51:00,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:51:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:51:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:51:00,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:00,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282098135] [2024-10-24 06:51:00,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282098135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:00,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:00,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:51:00,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295813879] [2024-10-24 06:51:00,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:00,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:51:00,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:00,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:51:00,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:51:00,401 INFO L87 Difference]: Start difference. First operand 129 states and 206 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:00,557 INFO L93 Difference]: Finished difference Result 288 states and 454 transitions. [2024-10-24 06:51:00,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:51:00,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-10-24 06:51:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:00,565 INFO L225 Difference]: With dead ends: 288 [2024-10-24 06:51:00,565 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 06:51:00,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:51:00,568 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 83 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:00,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 241 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:51:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 06:51:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 95. [2024-10-24 06:51:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 61 states have internal predecessors, (86), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:51:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 148 transitions. [2024-10-24 06:51:00,583 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 148 transitions. Word has length 195 [2024-10-24 06:51:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:00,584 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 148 transitions. [2024-10-24 06:51:00,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 148 transitions. [2024-10-24 06:51:00,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 06:51:00,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:00,587 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:00,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:51:00,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:00,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:00,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1993343014, now seen corresponding path program 1 times [2024-10-24 06:51:00,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:00,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231923899] [2024-10-24 06:51:00,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:00,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:51:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:51:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:51:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:51:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:51:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:51:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:51:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:51:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:51:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:51:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:51:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:51:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:51:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:51:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:51:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:51:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:51:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:51:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:51:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:51:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:51:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:51:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:51:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:51:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:51:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:51:00,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:00,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231923899] [2024-10-24 06:51:00,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231923899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:00,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:00,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:51:00,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115156421] [2024-10-24 06:51:00,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:00,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:51:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:00,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:51:00,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:51:00,800 INFO L87 Difference]: Start difference. First operand 95 states and 148 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:00,857 INFO L93 Difference]: Finished difference Result 189 states and 295 transitions. [2024-10-24 06:51:00,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:51:00,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 06:51:00,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:00,862 INFO L225 Difference]: With dead ends: 189 [2024-10-24 06:51:00,863 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 06:51:00,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:51:00,867 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:00,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:51:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 06:51:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-24 06:51:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:51:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2024-10-24 06:51:00,886 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 196 [2024-10-24 06:51:00,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:00,886 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2024-10-24 06:51:00,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2024-10-24 06:51:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 06:51:00,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:00,890 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:00,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:51:00,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:00,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1211727577, now seen corresponding path program 1 times [2024-10-24 06:51:00,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:00,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862120955] [2024-10-24 06:51:00,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:00,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:51:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:51:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:51:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:51:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:51:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:51:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:51:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:51:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:51:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:51:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:51:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:51:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:51:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:51:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:51:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:51:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:51:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:51:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:51:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:51:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:51:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:51:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:51:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:51:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:51:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:51:01,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:01,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862120955] [2024-10-24 06:51:01,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862120955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:01,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:01,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:51:01,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994253720] [2024-10-24 06:51:01,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:01,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:51:01,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:01,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:51:01,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:51:01,300 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:01,350 INFO L93 Difference]: Finished difference Result 280 states and 436 transitions. [2024-10-24 06:51:01,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:51:01,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-24 06:51:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:01,358 INFO L225 Difference]: With dead ends: 280 [2024-10-24 06:51:01,358 INFO L226 Difference]: Without dead ends: 187 [2024-10-24 06:51:01,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:51:01,360 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 79 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:01,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 296 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:51:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-24 06:51:01,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2024-10-24 06:51:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 118 states have internal predecessors, (165), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 06:51:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2024-10-24 06:51:01,384 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 289 transitions. Word has length 196 [2024-10-24 06:51:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:01,385 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 289 transitions. [2024-10-24 06:51:01,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 289 transitions. [2024-10-24 06:51:01,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:51:01,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:01,387 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:01,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:51:01,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:01,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash 844062065, now seen corresponding path program 1 times [2024-10-24 06:51:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:01,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227299586] [2024-10-24 06:51:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:01,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:51:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:51:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:51:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:51:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:51:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:51:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:51:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:51:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:51:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:51:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:51:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:51:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:51:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:51:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:51:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:51:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:51:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:51:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:51:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:51:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:51:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:51:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:51:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:51:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:51:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:51:01,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:01,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227299586] [2024-10-24 06:51:01,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227299586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:01,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:01,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:51:01,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235447816] [2024-10-24 06:51:01,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:01,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:51:01,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:01,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:51:01,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:01,650 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:02,098 INFO L93 Difference]: Finished difference Result 544 states and 852 transitions. [2024-10-24 06:51:02,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:51:02,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-10-24 06:51:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:02,103 INFO L225 Difference]: With dead ends: 544 [2024-10-24 06:51:02,103 INFO L226 Difference]: Without dead ends: 451 [2024-10-24 06:51:02,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:51:02,106 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 259 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:02,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 420 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 06:51:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-24 06:51:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 206. [2024-10-24 06:51:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 139 states have (on average 1.4244604316546763) internal successors, (198), 139 states have internal predecessors, (198), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 06:51:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 322 transitions. [2024-10-24 06:51:02,148 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 322 transitions. Word has length 197 [2024-10-24 06:51:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:02,148 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 322 transitions. [2024-10-24 06:51:02,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 322 transitions. [2024-10-24 06:51:02,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:51:02,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:02,151 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:02,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 06:51:02,151 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:02,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:02,152 INFO L85 PathProgramCache]: Analyzing trace with hash 140774738, now seen corresponding path program 1 times [2024-10-24 06:51:02,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:02,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382715859] [2024-10-24 06:51:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:51:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:51:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:51:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:51:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:51:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:51:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:51:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:51:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:51:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:51:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:51:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:51:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:51:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:51:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:51:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:51:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:51:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:51:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:51:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:51:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:51:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:51:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:51:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:51:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:51:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:51:02,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:02,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382715859] [2024-10-24 06:51:02,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382715859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:02,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:02,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:51:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515417314] [2024-10-24 06:51:02,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:02,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:51:02,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:02,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:51:02,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:02,487 INFO L87 Difference]: Start difference. First operand 206 states and 322 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:02,856 INFO L93 Difference]: Finished difference Result 655 states and 1019 transitions. [2024-10-24 06:51:02,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:51:02,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-10-24 06:51:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:02,864 INFO L225 Difference]: With dead ends: 655 [2024-10-24 06:51:02,864 INFO L226 Difference]: Without dead ends: 450 [2024-10-24 06:51:02,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:02,866 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 261 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:02,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 391 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:51:02,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-10-24 06:51:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 243. [2024-10-24 06:51:02,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 176 states have (on average 1.4602272727272727) internal successors, (257), 176 states have internal predecessors, (257), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 06:51:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 381 transitions. [2024-10-24 06:51:02,912 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 381 transitions. Word has length 197 [2024-10-24 06:51:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:02,914 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 381 transitions. [2024-10-24 06:51:02,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 381 transitions. [2024-10-24 06:51:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:51:02,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:02,919 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:02,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 06:51:02,919 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:02,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash 26413615, now seen corresponding path program 1 times [2024-10-24 06:51:02,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:02,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949441842] [2024-10-24 06:51:02,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:02,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:51:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:51:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:51:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:51:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:51:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:51:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:51:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:51:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:51:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:51:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:51:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:51:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:51:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:51:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:51:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:51:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:51:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:51:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:51:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:51:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:51:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:51:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:51:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:51:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:51:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:51:03,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:03,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949441842] [2024-10-24 06:51:03,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949441842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:03,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:03,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:51:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494142578] [2024-10-24 06:51:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:03,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:51:03,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:03,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:51:03,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:51:03,187 INFO L87 Difference]: Start difference. First operand 243 states and 381 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:03,394 INFO L93 Difference]: Finished difference Result 484 states and 763 transitions. [2024-10-24 06:51:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:51:03,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-10-24 06:51:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:03,398 INFO L225 Difference]: With dead ends: 484 [2024-10-24 06:51:03,398 INFO L226 Difference]: Without dead ends: 358 [2024-10-24 06:51:03,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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-10-24 06:51:03,401 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 105 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:03,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 381 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:51:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-24 06:51:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 239. [2024-10-24 06:51:03,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 172 states have (on average 1.4593023255813953) internal successors, (251), 172 states have internal predecessors, (251), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 06:51:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 375 transitions. [2024-10-24 06:51:03,431 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 375 transitions. Word has length 197 [2024-10-24 06:51:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:03,431 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 375 transitions. [2024-10-24 06:51:03,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 375 transitions. [2024-10-24 06:51:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:51:03,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:03,434 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:03,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 06:51:03,435 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:03,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash -676873712, now seen corresponding path program 1 times [2024-10-24 06:51:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:03,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234480628] [2024-10-24 06:51:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:03,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:51:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:51:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:51:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:51:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:51:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:51:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:51:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:51:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:51:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:51:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:51:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:51:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:51:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:51:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:51:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:51:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:51:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:51:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:51:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:51:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:51:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:51:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:51:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:51:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:51:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:51:03,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:03,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234480628] [2024-10-24 06:51:03,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234480628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:03,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:03,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:51:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543175124] [2024-10-24 06:51:03,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:03,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:51:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:51:03,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:03,722 INFO L87 Difference]: Start difference. First operand 239 states and 375 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:04,179 INFO L93 Difference]: Finished difference Result 684 states and 1062 transitions. [2024-10-24 06:51:04,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:51:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-10-24 06:51:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:04,183 INFO L225 Difference]: With dead ends: 684 [2024-10-24 06:51:04,183 INFO L226 Difference]: Without dead ends: 446 [2024-10-24 06:51:04,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:04,185 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 335 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:04,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 269 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 06:51:04,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-24 06:51:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 257. [2024-10-24 06:51:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 190 states have (on average 1.4684210526315788) internal successors, (279), 190 states have internal predecessors, (279), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 06:51:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 403 transitions. [2024-10-24 06:51:04,220 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 403 transitions. Word has length 197 [2024-10-24 06:51:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:04,220 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 403 transitions. [2024-10-24 06:51:04,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 403 transitions. [2024-10-24 06:51:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:51:04,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:04,223 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:04,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 06:51:04,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:04,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash -619615410, now seen corresponding path program 1 times [2024-10-24 06:51:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822421740] [2024-10-24 06:51:04,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:04,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:51:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:51:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:51:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:51:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:51:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:51:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:51:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:51:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:51:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:51:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:51:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:51:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:51:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:51:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:51:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:51:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:51:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:51:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:51:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:51:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:51:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:51:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:51:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:51:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:51:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:51:04,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:04,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822421740] [2024-10-24 06:51:04,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822421740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:04,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:04,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:51:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774613981] [2024-10-24 06:51:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:04,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:51:04,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:04,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:51:04,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:04,534 INFO L87 Difference]: Start difference. First operand 257 states and 403 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:04,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:04,962 INFO L93 Difference]: Finished difference Result 698 states and 1082 transitions. [2024-10-24 06:51:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:51:04,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-10-24 06:51:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:04,966 INFO L225 Difference]: With dead ends: 698 [2024-10-24 06:51:04,966 INFO L226 Difference]: Without dead ends: 438 [2024-10-24 06:51:04,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:51:04,967 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 245 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:04,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 347 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:51:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-24 06:51:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 257. [2024-10-24 06:51:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 190 states have (on average 1.4473684210526316) internal successors, (275), 190 states have internal predecessors, (275), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 06:51:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 399 transitions. [2024-10-24 06:51:05,004 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 399 transitions. Word has length 197 [2024-10-24 06:51:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:05,006 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 399 transitions. [2024-10-24 06:51:05,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 399 transitions. [2024-10-24 06:51:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:51:05,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:05,009 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:05,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 06:51:05,009 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:05,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1428962036, now seen corresponding path program 1 times [2024-10-24 06:51:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:05,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970431318] [2024-10-24 06:51:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:05,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:51:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 06:51:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 06:51:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 06:51:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 06:51:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 06:51:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 06:51:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 06:51:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 06:51:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 06:51:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 06:51:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 06:51:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 06:51:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 06:51:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 06:51:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 06:51:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 06:51:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 06:51:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 06:51:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 06:51:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 06:51:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 06:51:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:51:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 06:51:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 06:51:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 06:51:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 06:51:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 06:51:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 06:51:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 06:51:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-24 06:51:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 06:51:05,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:51:05,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970431318] [2024-10-24 06:51:05,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970431318] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:51:05,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484701759] [2024-10-24 06:51:05,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:05,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:51:05,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:51:05,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:51:05,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 06:51:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:05,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 06:51:05,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 688 proven. 69 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2024-10-24 06:51:06,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:51:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 06:51:07,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484701759] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:51:07,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 06:51:07,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 17 [2024-10-24 06:51:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407185438] [2024-10-24 06:51:07,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 06:51:07,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 06:51:07,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:51:07,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 06:51:07,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-10-24 06:51:07,041 INFO L87 Difference]: Start difference. First operand 257 states and 399 transitions. Second operand has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 4 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 4 states have call predecessors, (93), 4 states have call successors, (93) [2024-10-24 06:51:08,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:08,625 INFO L93 Difference]: Finished difference Result 895 states and 1352 transitions. [2024-10-24 06:51:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-24 06:51:08,626 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 4 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 4 states have call predecessors, (93), 4 states have call successors, (93) Word has length 197 [2024-10-24 06:51:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:08,630 INFO L225 Difference]: With dead ends: 895 [2024-10-24 06:51:08,631 INFO L226 Difference]: Without dead ends: 639 [2024-10-24 06:51:08,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=466, Invalid=1256, Unknown=0, NotChecked=0, Total=1722 [2024-10-24 06:51:08,633 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 444 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:08,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 1181 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 06:51:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-24 06:51:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 293. [2024-10-24 06:51:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 217 states have (on average 1.433179723502304) internal successors, (311), 218 states have internal predecessors, (311), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-24 06:51:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 449 transitions. [2024-10-24 06:51:08,681 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 449 transitions. Word has length 197 [2024-10-24 06:51:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:08,681 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 449 transitions. [2024-10-24 06:51:08,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.823529411764706) internal successors, (99), 17 states have internal predecessors, (99), 4 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 4 states have call predecessors, (93), 4 states have call successors, (93) [2024-10-24 06:51:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 449 transitions. [2024-10-24 06:51:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-24 06:51:08,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:08,685 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:08,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 06:51:08,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 06:51:08,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:08,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash -748903666, now seen corresponding path program 1 times [2024-10-24 06:51:08,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:51:08,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580764340] [2024-10-24 06:51:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:08,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:51:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:51:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064564188] [2024-10-24 06:51:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:08,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:51:08,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:51:08,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:51:08,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 06:51:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:51:09,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:51:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:51:09,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:51:09,302 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:51:09,303 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:51:09,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 06:51:09,505 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,SelfDestructingSolverStorable11 [2024-10-24 06:51:09,508 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:09,640 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:51:09,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:51:09 BoogieIcfgContainer [2024-10-24 06:51:09,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:51:09,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:51:09,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:51:09,644 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:51:09,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:50:58" (3/4) ... [2024-10-24 06:51:09,647 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:51:09,648 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:51:09,649 INFO L158 Benchmark]: Toolchain (without parser) took 12669.50ms. Allocated memory was 167.8MB in the beginning and 320.9MB in the end (delta: 153.1MB). Free memory was 112.5MB in the beginning and 143.8MB in the end (delta: -31.3MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. [2024-10-24 06:51:09,649 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:51:09,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.90ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 95.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 06:51:09,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.29ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 91.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:51:09,650 INFO L158 Benchmark]: Boogie Preprocessor took 79.79ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 86.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:51:09,651 INFO L158 Benchmark]: RCFGBuilder took 738.07ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 55.5MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 06:51:09,651 INFO L158 Benchmark]: TraceAbstraction took 11350.63ms. Allocated memory was 167.8MB in the beginning and 320.9MB in the end (delta: 153.1MB). Free memory was 54.7MB in the beginning and 144.9MB in the end (delta: -90.2MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2024-10-24 06:51:09,651 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 320.9MB. Free memory was 144.9MB in the beginning and 143.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 06:51:09,653 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.19ms. Allocated memory is still 167.8MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.90ms. Allocated memory is still 167.8MB. Free memory was 112.5MB in the beginning and 95.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.29ms. Allocated memory is still 167.8MB. Free memory was 95.3MB in the beginning and 91.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.79ms. Allocated memory is still 167.8MB. Free memory was 91.2MB in the beginning and 86.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 738.07ms. Allocated memory is still 167.8MB. Free memory was 86.2MB in the beginning and 55.5MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11350.63ms. Allocated memory was 167.8MB in the beginning and 320.9MB in the end (delta: 153.1MB). Free memory was 54.7MB in the beginning and 144.9MB in the end (delta: -90.2MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 320.9MB. Free memory was 144.9MB in the beginning and 143.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; [L43] unsigned char var_1_28 = 1; [L44] unsigned long int var_1_33 = 10; [L45] unsigned long int var_1_35 = 2632045268; [L46] signed long int var_1_36 = 32; [L47] unsigned long int var_1_37 = 128; [L48] unsigned long int var_1_39 = 1877460848; [L49] unsigned long int var_1_40 = 1831388024; [L50] unsigned long int var_1_41 = 1967003719; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_46 = 0; [L53] unsigned short int var_1_49 = 0; [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] FCALL updateLastVariables() [L196] CALL updateVariables() [L136] var_1_9 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L137] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L138] var_1_11 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L139] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L140] var_1_13 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L141] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L142] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L142] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L143] var_1_14 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L144] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L145] var_1_16 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L146] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L147] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L147] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L148] var_1_17 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L149] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L150] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L150] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L151] var_1_19 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L152] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L153] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L153] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L154] var_1_20 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L156] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L156] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L157] var_1_21 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L158] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L159] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L159] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L160] var_1_22 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L161] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L162] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L162] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L163] var_1_24 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L164] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L165] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L165] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L166] var_1_25 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L167] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L168] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L168] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L169] var_1_26 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L170] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L171] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L171] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L172] var_1_35 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L173] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L174] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L174] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L175] var_1_39 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_39 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L176] RET assume_abort_if_not(var_1_39 >= 1073741823) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L177] CALL assume_abort_if_not(var_1_39 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L177] RET assume_abort_if_not(var_1_39 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L178] var_1_40 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_40 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L179] RET assume_abort_if_not(var_1_40 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L180] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L180] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L181] var_1_41 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_41 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L182] RET assume_abort_if_not(var_1_41 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L183] CALL assume_abort_if_not(var_1_41 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L183] RET assume_abort_if_not(var_1_41 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L196] RET updateVariables() [L197] CALL step() [L57] var_1_15 = (var_1_16 - var_1_17) [L58] var_1_27 = var_1_21 [L59] unsigned char stepLocal_1 = var_1_27; [L60] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L61] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L62] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L70] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L73] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L74] COND FALSE !(var_1_27 > stepLocal_2) [L77] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L79] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L80] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L82] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L83] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L92] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L93] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L94] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L97] COND TRUE 1 >= stepLocal_3 [L98] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L103] EXPR var_1_27 | (var_1_21 + var_1_27) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L103] COND FALSE !(var_1_27 < (var_1_27 | (var_1_21 + var_1_27))) [L106] EXPR var_1_21 >> var_1_21 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L106] COND TRUE var_1_21 >= (var_1_21 >> var_1_21) [L107] COND FALSE !(var_1_23 || (var_1_17 < var_1_21)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L111] COND FALSE !(var_1_27 > (var_1_20 / var_1_35)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L114] COND TRUE 63.75f <= var_1_11 [L115] var_1_37 = ((var_1_39 + ((((var_1_40) > (var_1_41)) ? (var_1_40) : (var_1_41)))) - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21)))) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L117] COND FALSE !(var_1_41 < ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27)))) [L120] var_1_42 = (var_1_25 || var_1_25) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L122] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L129] COND FALSE !((var_1_39 - ((((-50) < 0 ) ? -(-50) : (-50)))) < var_1_27) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=126, var_1_16=126, var_1_17=0, var_1_18=0, var_1_19=-63, var_1_1=128, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-11811160065, var_1_40=1073741824, var_1_41=5368709120, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 12, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1933 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1875 mSDsluCounter, 4262 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2633 mSDsCounter, 257 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2663 IncrementalHoareTripleChecker+Invalid, 2920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 257 mSolverCounterUnsat, 1629 mSDtfsCounter, 2663 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1188 GetRequests, 1126 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=293occurred in iteration=11, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1358 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 2750 NumberOfCodeBlocks, 2750 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2540 ConstructedInterpolants, 0 QuantifiedInterpolants, 5238 SizeOfPredicates, 6 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 23973/24180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 06:51:09,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.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 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:51:12,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:51:12,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:51:12,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:51:12,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:51:12,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:51:12,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:51:12,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:51:12,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:51:12,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:51:12,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:51:12,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:51:12,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:51:12,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:51:12,164 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:51:12,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:51:12,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:51:12,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:51:12,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:51:12,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:51:12,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:51:12,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:51:12,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:51:12,171 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:51:12,171 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:51:12,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:51:12,172 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:51:12,172 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:51:12,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:51:12,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:51:12,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:51:12,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:51:12,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:51:12,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:51:12,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:51:12,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:51:12,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:51:12,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:51:12,176 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:51:12,176 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:51:12,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:51:12,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:51:12,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:51:12,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:51:12,178 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:51:12,178 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 -> 178c8e25fe6500dd13d8dde78f808ba54650ed4da41e205cb23b94c6857c8efc [2024-10-24 06:51:12,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:51:12,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:51:12,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:51:12,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:51:12,551 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:51:12,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-10-24 06:51:14,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:51:14,357 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:51:14,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-10-24 06:51:14,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c0d6a30/99b8cb47b89e489c854158465a3efa07/FLAG1854636e5 [2024-10-24 06:51:14,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c0d6a30/99b8cb47b89e489c854158465a3efa07 [2024-10-24 06:51:14,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:51:14,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:51:14,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:51:14,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:51:14,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:51:14,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3bc560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14, skipping insertion in model container [2024-10-24 06:51:14,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:51:14,637 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i[918,931] [2024-10-24 06:51:14,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:51:14,744 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:51:14,760 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i[918,931] [2024-10-24 06:51:14,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:51:14,840 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:51:14,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14 WrapperNode [2024-10-24 06:51:14,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:51:14,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:51:14,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:51:14,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:51:14,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,905 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-10-24 06:51:14,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:51:14,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:51:14,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:51:14,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:51:14,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,958 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 06:51:14,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,977 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,985 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:14,994 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:51:14,995 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:51:14,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:51:14,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:51:14,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (1/1) ... [2024-10-24 06:51:15,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:51:15,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:51:15,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 06:51:15,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:51:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:51:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:51:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:51:15,096 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:51:15,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:51:15,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:51:15,182 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:51:15,184 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:51:15,722 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:51:15,722 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:51:15,781 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:51:15,782 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:51:15,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:51:15 BoogieIcfgContainer [2024-10-24 06:51:15,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:51:15,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:51:15,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:51:15,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:51:15,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:51:14" (1/3) ... [2024-10-24 06:51:15,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e294e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:51:15, skipping insertion in model container [2024-10-24 06:51:15,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:51:14" (2/3) ... [2024-10-24 06:51:15,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e294e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:51:15, skipping insertion in model container [2024-10-24 06:51:15,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:51:15" (3/3) ... [2024-10-24 06:51:15,791 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-1.i [2024-10-24 06:51:15,807 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:51:15,807 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:51:15,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:51:15,890 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;@4a9c8cb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:51:15,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:51:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:51:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-24 06:51:15,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:15,914 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:15,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:15,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:15,921 INFO L85 PathProgramCache]: Analyzing trace with hash -99814374, now seen corresponding path program 1 times [2024-10-24 06:51:15,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:51:15,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750965198] [2024-10-24 06:51:15,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:15,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:15,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:51:15,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:51:15,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 06:51:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:16,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:51:16,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 1044 trivial. 0 not checked. [2024-10-24 06:51:16,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:51:16,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:51:16,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750965198] [2024-10-24 06:51:16,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750965198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:16,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:16,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:51:16,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240039066] [2024-10-24 06:51:16,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:16,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:51:16,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:51:16,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:51:16,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:51:16,450 INFO L87 Difference]: Start difference. First operand has 85 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:51:16,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:16,518 INFO L93 Difference]: Finished difference Result 167 states and 307 transitions. [2024-10-24 06:51:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:51:16,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 193 [2024-10-24 06:51:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:16,533 INFO L225 Difference]: With dead ends: 167 [2024-10-24 06:51:16,533 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 06:51:16,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:51:16,544 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:16,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:51:16,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 06:51:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-24 06:51:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:51:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2024-10-24 06:51:16,595 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 133 transitions. Word has length 193 [2024-10-24 06:51:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:16,596 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 133 transitions. [2024-10-24 06:51:16,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 06:51:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2024-10-24 06:51:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-24 06:51:16,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:16,600 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:16,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 06:51:16,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:16,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:16,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash -896995108, now seen corresponding path program 1 times [2024-10-24 06:51:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:51:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020850101] [2024-10-24 06:51:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:16,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:16,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:51:16,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:51:16,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 06:51:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:17,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 06:51:17,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-24 06:51:17,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:51:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:51:17,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:51:17,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020850101] [2024-10-24 06:51:17,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020850101] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 06:51:17,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 06:51:17,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-10-24 06:51:17,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888342071] [2024-10-24 06:51:17,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:17,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:51:17,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:51:17,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:51:17,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 06:51:17,927 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:18,054 INFO L93 Difference]: Finished difference Result 165 states and 265 transitions. [2024-10-24 06:51:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:51:18,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2024-10-24 06:51:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:18,057 INFO L225 Difference]: With dead ends: 165 [2024-10-24 06:51:18,057 INFO L226 Difference]: Without dead ends: 83 [2024-10-24 06:51:18,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 06:51:18,059 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:18,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:51:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-24 06:51:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-24 06:51:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 06:51:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 132 transitions. [2024-10-24 06:51:18,081 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 132 transitions. Word has length 193 [2024-10-24 06:51:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:18,083 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 132 transitions. [2024-10-24 06:51:18,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 132 transitions. [2024-10-24 06:51:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-24 06:51:18,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:18,087 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:18,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 06:51:18,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:18,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:18,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1918063462, now seen corresponding path program 1 times [2024-10-24 06:51:18,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:51:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932449188] [2024-10-24 06:51:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:18,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:18,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:51:18,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:51:18,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 06:51:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:18,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 06:51:18,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:51:18,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:51:18,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:51:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932449188] [2024-10-24 06:51:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932449188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:18,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:51:18,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:51:18,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551978660] [2024-10-24 06:51:18,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:18,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:51:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:51:18,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:51:18,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:51:18,908 INFO L87 Difference]: Start difference. First operand 83 states and 132 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:18,999 INFO L93 Difference]: Finished difference Result 247 states and 394 transitions. [2024-10-24 06:51:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:51:19,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2024-10-24 06:51:19,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:19,004 INFO L225 Difference]: With dead ends: 247 [2024-10-24 06:51:19,005 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 06:51:19,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:51:19,009 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 36 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:19,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 273 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:51:19,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 06:51:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2024-10-24 06:51:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 98 states have internal predecessors, (137), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 06:51:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 261 transitions. [2024-10-24 06:51:19,037 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 261 transitions. Word has length 193 [2024-10-24 06:51:19,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:19,038 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 261 transitions. [2024-10-24 06:51:19,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 261 transitions. [2024-10-24 06:51:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 06:51:19,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:19,041 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:19,053 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-10-24 06:51:19,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:19,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:19,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:19,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1185587378, now seen corresponding path program 1 times [2024-10-24 06:51:19,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:51:19,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584875] [2024-10-24 06:51:19,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:19,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:19,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:51:19,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:51:19,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 06:51:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:19,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 06:51:19,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 940 proven. 51 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2024-10-24 06:51:19,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:51:19,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:51:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584875] [2024-10-24 06:51:19,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 06:51:19,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [976605039] [2024-10-24 06:51:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:19,820 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 06:51:19,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 06:51:19,824 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-10-24 06:51:19,829 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-10-24 06:51:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:20,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 06:51:20,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-24 06:51:20,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:51:20,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [976605039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:51:20,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 06:51:20,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-10-24 06:51:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232717512] [2024-10-24 06:51:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:51:20,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:51:20,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:51:20,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:51:20,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-24 06:51:20,693 INFO L87 Difference]: Start difference. First operand 163 states and 261 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:21,572 INFO L93 Difference]: Finished difference Result 487 states and 775 transitions. [2024-10-24 06:51:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:51:21,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 194 [2024-10-24 06:51:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:21,580 INFO L225 Difference]: With dead ends: 487 [2024-10-24 06:51:21,581 INFO L226 Difference]: Without dead ends: 325 [2024-10-24 06:51:21,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-24 06:51:21,585 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 265 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:21,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 355 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 06:51:21,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-24 06:51:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 218. [2024-10-24 06:51:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 139 states have internal predecessors, (188), 75 states have call successors, (75), 4 states have call predecessors, (75), 4 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-24 06:51:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 338 transitions. [2024-10-24 06:51:21,631 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 338 transitions. Word has length 194 [2024-10-24 06:51:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:21,632 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 338 transitions. [2024-10-24 06:51:21,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-24 06:51:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 338 transitions. [2024-10-24 06:51:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 06:51:21,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:21,639 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:21,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 06:51:21,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-10-24 06:51:22,040 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-10-24 06:51:22,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:22,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash -605713349, now seen corresponding path program 1 times [2024-10-24 06:51:22,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:51:22,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856438358] [2024-10-24 06:51:22,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:22,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:22,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:51:22,044 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-10-24 06:51:22,045 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-10-24 06:51:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:22,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 06:51:22,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:51:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1085 proven. 159 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-10-24 06:51:23,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:51:24,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-10-24 06:51:24,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:51:24,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856438358] [2024-10-24 06:51:24,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856438358] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:51:24,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:51:24,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 24 [2024-10-24 06:51:24,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111538278] [2024-10-24 06:51:24,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:51:24,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-24 06:51:24,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:51:24,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-24 06:51:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2024-10-24 06:51:24,763 INFO L87 Difference]: Start difference. First operand 218 states and 338 transitions. Second operand has 24 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 23 states have internal predecessors, (86), 5 states have call successors, (62), 5 states have call predecessors, (62), 8 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2024-10-24 06:51:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:51:29,924 INFO L93 Difference]: Finished difference Result 1251 states and 1860 transitions. [2024-10-24 06:51:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-10-24 06:51:29,926 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 23 states have internal predecessors, (86), 5 states have call successors, (62), 5 states have call predecessors, (62), 8 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) Word has length 195 [2024-10-24 06:51:29,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:51:29,938 INFO L225 Difference]: With dead ends: 1251 [2024-10-24 06:51:29,938 INFO L226 Difference]: Without dead ends: 1055 [2024-10-24 06:51:29,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1677, Invalid=3293, Unknown=0, NotChecked=0, Total=4970 [2024-10-24 06:51:29,941 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1152 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-24 06:51:29,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 821 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-24 06:51:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2024-10-24 06:51:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 405. [2024-10-24 06:51:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 275 states have (on average 1.3345454545454545) internal successors, (367), 277 states have internal predecessors, (367), 113 states have call successors, (113), 16 states have call predecessors, (113), 16 states have return successors, (113), 111 states have call predecessors, (113), 113 states have call successors, (113) [2024-10-24 06:51:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 593 transitions. [2024-10-24 06:51:30,014 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 593 transitions. Word has length 195 [2024-10-24 06:51:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:51:30,016 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 593 transitions. [2024-10-24 06:51:30,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 23 states have internal predecessors, (86), 5 states have call successors, (62), 5 states have call predecessors, (62), 8 states have return successors, (62), 5 states have call predecessors, (62), 5 states have call successors, (62) [2024-10-24 06:51:30,016 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 593 transitions. [2024-10-24 06:51:30,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 06:51:30,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:51:30,020 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:51:30,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-24 06:51:30,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:30,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:51:30,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:51:30,223 INFO L85 PathProgramCache]: Analyzing trace with hash -677743303, now seen corresponding path program 1 times [2024-10-24 06:51:30,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:51:30,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374689760] [2024-10-24 06:51:30,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:51:30,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 06:51:30,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:51:30,227 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 06:51:30,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 06:51:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:51:30,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 06:51:30,432 INFO L278 TraceCheckSpWp]: Computing forward predicates...