./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.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-pr-ci_file-32.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 a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:26:47,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:26:47,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:26:47,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:26:47,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:26:47,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:26:47,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:26:47,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:26:47,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:26:47,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:26:47,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:26:47,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:26:47,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:26:47,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:26:47,404 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:26:47,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:26:47,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:26:47,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:26:47,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:26:47,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:26:47,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:26:47,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:26:47,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:26:47,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:26:47,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:26:47,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:26:47,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:26:47,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:26:47,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:26:47,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:26:47,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:26:47,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:26:47,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:26:47,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:26:47,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:26:47,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:26:47,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:26:47,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:26:47,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:26:47,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:26:47,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:26:47,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:26:47,414 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 -> a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 [2024-10-24 07:26:47,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:26:47,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:26:47,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:26:47,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:26:47,672 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:26:47,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2024-10-24 07:26:49,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:26:49,324 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:26:49,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2024-10-24 07:26:49,341 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ad9e144/05f6d1b47b17499fac635ff74b1e3e34/FLAG281314fc8 [2024-10-24 07:26:49,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ad9e144/05f6d1b47b17499fac635ff74b1e3e34 [2024-10-24 07:26:49,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:26:49,672 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:26:49,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:26:49,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:26:49,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:26:49,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:26:49" (1/1) ... [2024-10-24 07:26:49,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365307d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:49, skipping insertion in model container [2024-10-24 07:26:49,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:26:49" (1/1) ... [2024-10-24 07:26:49,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:26:49,866 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i[919,932] [2024-10-24 07:26:49,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:26:49,959 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:26:49,979 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i[919,932] [2024-10-24 07:26:50,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:26:50,027 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:26:50,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50 WrapperNode [2024-10-24 07:26:50,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:26:50,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:26:50,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:26:50,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:26:50,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,099 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 237 [2024-10-24 07:26:50,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:26:50,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:26:50,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:26:50,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:26:50,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,148 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 07:26:50,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,191 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:26:50,192 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:26:50,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:26:50,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:26:50,193 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (1/1) ... [2024-10-24 07:26:50,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:26:50,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:26:50,232 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 07:26:50,235 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 07:26:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:26:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:26:50,271 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:26:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:26:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:26:50,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:26:50,349 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:26:50,352 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:26:50,714 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-24 07:26:50,714 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:26:50,763 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:26:50,764 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:26:50,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:26:50 BoogieIcfgContainer [2024-10-24 07:26:50,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:26:50,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:26:50,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:26:50,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:26:50,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:26:49" (1/3) ... [2024-10-24 07:26:50,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5503306e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:26:50, skipping insertion in model container [2024-10-24 07:26:50,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:26:50" (2/3) ... [2024-10-24 07:26:50,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5503306e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:26:50, skipping insertion in model container [2024-10-24 07:26:50,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:26:50" (3/3) ... [2024-10-24 07:26:50,794 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2024-10-24 07:26:50,809 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:26:50,809 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:26:50,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:26:50,937 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;@31005d49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:26:50,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:26:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 66 states have (on average 1.606060606060606) internal successors, (106), 67 states have internal predecessors, (106), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 07:26:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 07:26:50,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:50,951 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:50,952 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:50,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:50,956 INFO L85 PathProgramCache]: Analyzing trace with hash -772085063, now seen corresponding path program 1 times [2024-10-24 07:26:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:50,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648261877] [2024-10-24 07:26:50,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:26:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:26:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:26:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:26:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:26:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:26:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:26:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:26:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:26:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:26:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:26:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:26:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 07:26:51,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:51,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648261877] [2024-10-24 07:26:51,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648261877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:51,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:51,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:26:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038862740] [2024-10-24 07:26:51,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:26:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:51,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:26:51,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:26:51,350 INFO L87 Difference]: Start difference. First operand has 92 states, 66 states have (on average 1.606060606060606) internal successors, (106), 67 states have internal predecessors, (106), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 07:26:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:51,393 INFO L93 Difference]: Finished difference Result 181 states and 325 transitions. [2024-10-24 07:26:51,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:26:51,396 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2024-10-24 07:26:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:51,403 INFO L225 Difference]: With dead ends: 181 [2024-10-24 07:26:51,404 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 07:26:51,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 07:26:51,413 INFO L432 NwaCegarLoop]: 142 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, 142 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 07:26:51,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:26:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 07:26:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-24 07:26:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.523076923076923) internal successors, (99), 65 states have internal predecessors, (99), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 07:26:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 145 transitions. [2024-10-24 07:26:51,463 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 145 transitions. Word has length 151 [2024-10-24 07:26:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:51,464 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 145 transitions. [2024-10-24 07:26:51,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 07:26:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 145 transitions. [2024-10-24 07:26:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 07:26:51,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:51,469 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:51,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:26:51,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:51,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:51,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1885236845, now seen corresponding path program 1 times [2024-10-24 07:26:51,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:51,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059790385] [2024-10-24 07:26:51,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:51,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:26:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:26:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:26:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:26:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:26:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:26:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:26:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:26:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:26:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:26:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:26:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:26:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 07:26:51,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:51,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059790385] [2024-10-24 07:26:51,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059790385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:51,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:51,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:26:51,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472550890] [2024-10-24 07:26:51,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:51,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:26:51,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:51,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:26:51,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:26:51,803 INFO L87 Difference]: Start difference. First operand 90 states and 145 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 07:26:51,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:51,906 INFO L93 Difference]: Finished difference Result 268 states and 433 transitions. [2024-10-24 07:26:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:26:51,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-10-24 07:26:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:51,909 INFO L225 Difference]: With dead ends: 268 [2024-10-24 07:26:51,909 INFO L226 Difference]: Without dead ends: 179 [2024-10-24 07:26:51,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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 07:26:51,914 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 86 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:51,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 253 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:26:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-24 07:26:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2024-10-24 07:26:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 127 states have (on average 1.5039370078740157) internal successors, (191), 127 states have internal predecessors, (191), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 07:26:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 283 transitions. [2024-10-24 07:26:51,940 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 283 transitions. Word has length 151 [2024-10-24 07:26:51,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:51,941 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 283 transitions. [2024-10-24 07:26:51,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 07:26:51,941 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 283 transitions. [2024-10-24 07:26:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-24 07:26:51,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:51,943 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:51,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:26:51,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:51,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:51,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1883389803, now seen corresponding path program 1 times [2024-10-24 07:26:51,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:51,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711604739] [2024-10-24 07:26:51,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:51,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:26:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:26:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:26:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:26:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:26:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:26:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:26:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:26:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:26:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:26:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:26:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:26:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 07:26:52,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:52,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711604739] [2024-10-24 07:26:52,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711604739] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:52,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:52,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:26:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808786985] [2024-10-24 07:26:52,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:52,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:26:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:52,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:26:52,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:26:52,394 INFO L87 Difference]: Start difference. First operand 176 states and 283 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 07:26:52,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:52,685 INFO L93 Difference]: Finished difference Result 407 states and 649 transitions. [2024-10-24 07:26:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:26:52,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-10-24 07:26:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:52,688 INFO L225 Difference]: With dead ends: 407 [2024-10-24 07:26:52,689 INFO L226 Difference]: Without dead ends: 232 [2024-10-24 07:26:52,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:26:52,691 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 193 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:52,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 460 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:26:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-24 07:26:52,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 225. [2024-10-24 07:26:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 173 states have (on average 1.5202312138728324) internal successors, (263), 174 states have internal predecessors, (263), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 07:26:52,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 359 transitions. [2024-10-24 07:26:52,729 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 359 transitions. Word has length 151 [2024-10-24 07:26:52,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:52,729 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 359 transitions. [2024-10-24 07:26:52,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 07:26:52,729 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 359 transitions. [2024-10-24 07:26:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-24 07:26:52,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:52,736 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:52,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:26:52,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:52,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash -309749158, now seen corresponding path program 1 times [2024-10-24 07:26:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:52,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561663600] [2024-10-24 07:26:52,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:52,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:26:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:26:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:26:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:26:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:26:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:26:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:26:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:26:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:26:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:26:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:26:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:26:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 07:26:52,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:52,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561663600] [2024-10-24 07:26:52,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561663600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:52,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:52,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:26:52,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470390596] [2024-10-24 07:26:52,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:52,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:26:52,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:52,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:26:52,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:26:52,926 INFO L87 Difference]: Start difference. First operand 225 states and 359 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 07:26:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:53,085 INFO L93 Difference]: Finished difference Result 452 states and 720 transitions. [2024-10-24 07:26:53,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:26:53,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2024-10-24 07:26:53,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:53,098 INFO L225 Difference]: With dead ends: 452 [2024-10-24 07:26:53,099 INFO L226 Difference]: Without dead ends: 228 [2024-10-24 07:26:53,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:26:53,100 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 131 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:53,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 469 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:26:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-24 07:26:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 225. [2024-10-24 07:26:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 173 states have (on average 1.5144508670520231) internal successors, (262), 174 states have internal predecessors, (262), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 07:26:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 358 transitions. [2024-10-24 07:26:53,137 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 358 transitions. Word has length 152 [2024-10-24 07:26:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:53,141 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 358 transitions. [2024-10-24 07:26:53,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 07:26:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 358 transitions. [2024-10-24 07:26:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 07:26:53,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:53,146 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:53,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:26:53,146 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:53,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:53,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1272523396, now seen corresponding path program 1 times [2024-10-24 07:26:53,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:53,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091700987] [2024-10-24 07:26:53,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:53,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:26:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:26:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:26:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:26:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:26:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:26:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:26:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:26:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:26:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:26:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:26:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:26:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 07:26:53,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:53,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091700987] [2024-10-24 07:26:53,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091700987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:53,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:53,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 07:26:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746578881] [2024-10-24 07:26:53,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:53,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:26:53,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:53,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:26:53,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:26:53,409 INFO L87 Difference]: Start difference. First operand 225 states and 358 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 07:26:53,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:53,591 INFO L93 Difference]: Finished difference Result 582 states and 926 transitions. [2024-10-24 07:26:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:26:53,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2024-10-24 07:26:53,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:53,596 INFO L225 Difference]: With dead ends: 582 [2024-10-24 07:26:53,596 INFO L226 Difference]: Without dead ends: 358 [2024-10-24 07:26:53,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-24 07:26:53,599 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 262 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:53,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 503 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:26:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-24 07:26:53,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 289. [2024-10-24 07:26:53,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 234 states have (on average 1.547008547008547) internal successors, (362), 236 states have internal predecessors, (362), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 07:26:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 462 transitions. [2024-10-24 07:26:53,615 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 462 transitions. Word has length 153 [2024-10-24 07:26:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:53,616 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 462 transitions. [2024-10-24 07:26:53,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 07:26:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 462 transitions. [2024-10-24 07:26:53,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-24 07:26:53,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:53,617 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:53,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 07:26:53,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:53,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:53,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1348914275, now seen corresponding path program 1 times [2024-10-24 07:26:53,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:53,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396454599] [2024-10-24 07:26:53,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:53,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:26:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:26:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:26:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:26:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:26:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:26:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:26:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:26:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:26:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:26:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:26:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:26:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 07:26:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:53,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396454599] [2024-10-24 07:26:53,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396454599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:53,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:53,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 07:26:53,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865995472] [2024-10-24 07:26:53,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:53,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:26:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:53,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:26:53,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:26:53,831 INFO L87 Difference]: Start difference. First operand 289 states and 462 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 07:26:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:54,041 INFO L93 Difference]: Finished difference Result 613 states and 972 transitions. [2024-10-24 07:26:54,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:26:54,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2024-10-24 07:26:54,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:54,044 INFO L225 Difference]: With dead ends: 613 [2024-10-24 07:26:54,044 INFO L226 Difference]: Without dead ends: 325 [2024-10-24 07:26:54,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:26:54,046 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 273 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:54,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 523 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:26:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-24 07:26:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 293. [2024-10-24 07:26:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 238 states have (on average 1.5546218487394958) internal successors, (370), 240 states have internal predecessors, (370), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 07:26:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 470 transitions. [2024-10-24 07:26:54,061 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 470 transitions. Word has length 154 [2024-10-24 07:26:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:54,061 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 470 transitions. [2024-10-24 07:26:54,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 07:26:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 470 transitions. [2024-10-24 07:26:54,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-24 07:26:54,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:54,063 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:54,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 07:26:54,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:54,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:54,064 INFO L85 PathProgramCache]: Analyzing trace with hash -597428952, now seen corresponding path program 1 times [2024-10-24 07:26:54,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:54,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127758778] [2024-10-24 07:26:54,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:26:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:26:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:26:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:26:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:26:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:26:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:26:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:26:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:26:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:26:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:26:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:26:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-24 07:26:54,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127758778] [2024-10-24 07:26:54,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127758778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:26:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112176962] [2024-10-24 07:26:54,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:54,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:26:54,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:26:54,340 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 07:26:54,342 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 07:26:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:54,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 07:26:54,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-10-24 07:26:54,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:26:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-24 07:26:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112176962] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:26:54,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:26:54,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-24 07:26:54,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400680190] [2024-10-24 07:26:54,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:26:54,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 07:26:54,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:54,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 07:26:54,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:26:54,804 INFO L87 Difference]: Start difference. First operand 293 states and 470 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-24 07:26:55,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:55,195 INFO L93 Difference]: Finished difference Result 646 states and 1006 transitions. [2024-10-24 07:26:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 07:26:55,195 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 154 [2024-10-24 07:26:55,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:55,198 INFO L225 Difference]: With dead ends: 646 [2024-10-24 07:26:55,198 INFO L226 Difference]: Without dead ends: 354 [2024-10-24 07:26:55,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-10-24 07:26:55,199 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 254 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:55,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 317 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:26:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-24 07:26:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 347. [2024-10-24 07:26:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 270 states have (on average 1.4444444444444444) internal successors, (390), 273 states have internal predecessors, (390), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 07:26:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 518 transitions. [2024-10-24 07:26:55,221 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 518 transitions. Word has length 154 [2024-10-24 07:26:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:55,221 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 518 transitions. [2024-10-24 07:26:55,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 3 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-10-24 07:26:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 518 transitions. [2024-10-24 07:26:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-24 07:26:55,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:55,223 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:55,238 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 07:26:55,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:26:55,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:55,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:55,425 INFO L85 PathProgramCache]: Analyzing trace with hash 676063227, now seen corresponding path program 1 times [2024-10-24 07:26:55,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:55,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095168828] [2024-10-24 07:26:55,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:26:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:26:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:26:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:26:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:26:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:26:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:26:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:26:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:26:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:26:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:26:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:26:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 07:26:55,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:55,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095168828] [2024-10-24 07:26:55,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095168828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:26:55,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:26:55,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:26:55,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136970187] [2024-10-24 07:26:55,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:26:55,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:26:55,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:55,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:26:55,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:26:55,596 INFO L87 Difference]: Start difference. First operand 347 states and 518 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 07:26:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:55,740 INFO L93 Difference]: Finished difference Result 685 states and 1021 transitions. [2024-10-24 07:26:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 07:26:55,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-10-24 07:26:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:55,744 INFO L225 Difference]: With dead ends: 685 [2024-10-24 07:26:55,744 INFO L226 Difference]: Without dead ends: 369 [2024-10-24 07:26:55,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:26:55,746 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 234 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:55,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 436 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:26:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-24 07:26:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 343. [2024-10-24 07:26:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 266 states have (on average 1.443609022556391) internal successors, (384), 269 states have internal predecessors, (384), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 07:26:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 512 transitions. [2024-10-24 07:26:55,766 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 512 transitions. Word has length 155 [2024-10-24 07:26:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:55,766 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 512 transitions. [2024-10-24 07:26:55,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 07:26:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 512 transitions. [2024-10-24 07:26:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 07:26:55,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:55,768 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:55,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 07:26:55,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:55,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:55,768 INFO L85 PathProgramCache]: Analyzing trace with hash -320785783, now seen corresponding path program 1 times [2024-10-24 07:26:55,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:55,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769429255] [2024-10-24 07:26:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:55,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:26:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:26:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:26:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:26:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:26:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:26:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:26:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:26:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:26:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:26:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:26:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:26:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-24 07:26:56,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:56,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769429255] [2024-10-24 07:26:56,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769429255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:26:56,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285647668] [2024-10-24 07:26:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:56,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:26:56,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:26:56,195 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 07:26:56,197 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 07:26:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:56,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 07:26:56,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:26:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-24 07:26:56,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:26:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-24 07:26:57,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285647668] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:26:57,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 07:26:57,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2024-10-24 07:26:57,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303503053] [2024-10-24 07:26:57,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 07:26:57,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 07:26:57,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:26:57,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 07:26:57,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-10-24 07:26:57,622 INFO L87 Difference]: Start difference. First operand 343 states and 512 transitions. Second operand has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-10-24 07:26:58,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:26:58,998 INFO L93 Difference]: Finished difference Result 1196 states and 1728 transitions. [2024-10-24 07:26:58,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-24 07:26:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) Word has length 156 [2024-10-24 07:26:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:26:59,004 INFO L225 Difference]: With dead ends: 1196 [2024-10-24 07:26:59,005 INFO L226 Difference]: Without dead ends: 884 [2024-10-24 07:26:59,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=637, Invalid=1813, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 07:26:59,008 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1528 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 07:26:59,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 535 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 07:26:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-10-24 07:26:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 668. [2024-10-24 07:26:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 550 states have (on average 1.4745454545454546) internal successors, (811), 555 states have internal predecessors, (811), 93 states have call successors, (93), 24 states have call predecessors, (93), 24 states have return successors, (93), 88 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-24 07:26:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 997 transitions. [2024-10-24 07:26:59,055 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 997 transitions. Word has length 156 [2024-10-24 07:26:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:26:59,056 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 997 transitions. [2024-10-24 07:26:59,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 5 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 5 states have call successors, (69) [2024-10-24 07:26:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 997 transitions. [2024-10-24 07:26:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 07:26:59,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:26:59,059 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:59,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 07:26:59,263 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,SelfDestructingSolverStorable8 [2024-10-24 07:26:59,264 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:26:59,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:26:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash -320726201, now seen corresponding path program 1 times [2024-10-24 07:26:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:26:59,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364250879] [2024-10-24 07:26:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:26:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:26:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:26:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:26:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:26:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 07:26:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:26:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 07:26:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:26:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:26:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:26:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 07:26:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:26:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:26:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:26:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:26:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 07:26:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 07:26:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:26:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 07:26:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:26:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:26:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:26:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:26:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:26:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-10-24 07:26:59,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:26:59,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364250879] [2024-10-24 07:26:59,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364250879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:26:59,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7525816] [2024-10-24 07:26:59,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:26:59,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:26:59,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:26:59,913 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:26:59,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 07:27:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:00,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 07:27:00,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 669 proven. 135 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-24 07:27:01,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:27:04,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7525816] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 07:27:04,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 07:27:04,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 22 [2024-10-24 07:27:04,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425867095] [2024-10-24 07:27:04,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 07:27:04,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 07:27:04,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:27:04,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 07:27:04,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2024-10-24 07:27:04,039 INFO L87 Difference]: Start difference. First operand 668 states and 997 transitions. Second operand has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) [2024-10-24 07:27:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:05,032 INFO L93 Difference]: Finished difference Result 910 states and 1319 transitions. [2024-10-24 07:27:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 07:27:05,033 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) Word has length 156 [2024-10-24 07:27:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:05,037 INFO L225 Difference]: With dead ends: 910 [2024-10-24 07:27:05,037 INFO L226 Difference]: Without dead ends: 277 [2024-10-24 07:27:05,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=343, Invalid=917, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 07:27:05,039 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 529 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:05,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 529 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 07:27:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-24 07:27:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 245. [2024-10-24 07:27:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 190 states have (on average 1.3368421052631578) internal successors, (254), 192 states have internal predecessors, (254), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 07:27:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 332 transitions. [2024-10-24 07:27:05,081 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 332 transitions. Word has length 156 [2024-10-24 07:27:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:05,081 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 332 transitions. [2024-10-24 07:27:05,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.363636363636363) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46) [2024-10-24 07:27:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 332 transitions. [2024-10-24 07:27:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 07:27:05,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:05,084 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:05,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 07:27:05,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:27:05,285 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:05,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1909074103, now seen corresponding path program 1 times [2024-10-24 07:27:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:27:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179913416] [2024-10-24 07:27:05,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:05,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:27:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:27:05,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:27:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:27:05,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:27:05,417 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:27:05,418 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:27:05,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 07:27:05,421 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:27:05,497 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:27:05,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:27:05 BoogieIcfgContainer [2024-10-24 07:27:05,499 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:27:05,499 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:27:05,499 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:27:05,500 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:27:05,500 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:26:50" (3/4) ... [2024-10-24 07:27:05,501 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:27:05,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:27:05,503 INFO L158 Benchmark]: Toolchain (without parser) took 15830.66ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 152.8MB in the beginning and 272.2MB in the end (delta: -119.4MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2024-10-24 07:27:05,503 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:27:05,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.72ms. Allocated memory is still 184.5MB. Free memory was 152.6MB in the beginning and 139.6MB in the end (delta: 13.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-10-24 07:27:05,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.94ms. Allocated memory is still 184.5MB. Free memory was 139.6MB in the beginning and 134.6MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 07:27:05,503 INFO L158 Benchmark]: Boogie Preprocessor took 90.96ms. Allocated memory is still 184.5MB. Free memory was 134.6MB in the beginning and 128.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 07:27:05,504 INFO L158 Benchmark]: RCFGBuilder took 573.02ms. Allocated memory is still 184.5MB. Free memory was 128.3MB in the beginning and 94.0MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 07:27:05,504 INFO L158 Benchmark]: TraceAbstraction took 14731.90ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 93.5MB in the beginning and 273.3MB in the end (delta: -179.8MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-10-24 07:27:05,504 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 369.1MB. Free memory was 273.3MB in the beginning and 272.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 07:27:05,505 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.72ms. Allocated memory is still 184.5MB. Free memory was 152.6MB in the beginning and 139.6MB in the end (delta: 13.0MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.94ms. Allocated memory is still 184.5MB. Free memory was 139.6MB in the beginning and 134.6MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.96ms. Allocated memory is still 184.5MB. Free memory was 134.6MB in the beginning and 128.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 573.02ms. Allocated memory is still 184.5MB. Free memory was 128.3MB in the beginning and 94.0MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14731.90ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 93.5MB in the beginning and 273.3MB in the end (delta: -179.8MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 369.1MB. Free memory was 273.3MB in the beginning and 272.2MB 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 someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryArithmeticFLOAToperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] signed long int var_1_25 = 64; [L43] unsigned long int var_1_32 = 2219578776; [L44] unsigned char var_1_34 = 0; [L45] unsigned char var_1_36 = 5; [L46] unsigned char var_1_41 = 32; [L47] double var_1_42 = 16.125; [L48] double var_1_43 = 256.5; [L49] signed short int var_1_45 = -10; [L50] unsigned char last_1_var_1_1 = 2; [L51] unsigned char last_1_var_1_15 = 1; [L52] signed char last_1_var_1_20 = 0; [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L177] last_1_var_1_1 = var_1_1 [L178] last_1_var_1_15 = var_1_15 [L179] last_1_var_1_20 = var_1_20 [L189] RET updateLastVariables() [L190] CALL updateVariables() [L139] var_1_4 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L140] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L141] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L141] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L142] var_1_5 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L143] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] var_1_6 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L146] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] var_1_7 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L149] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L150] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L150] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=32, var_1_9=201/2] [L151] var_1_8 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_9=201/2] [L152] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_9=201/2] [L153] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L153] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L154] var_1_11 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L155] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L156] var_1_12 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L157] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L158] var_1_16 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L159] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L160] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L160] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L161] var_1_17 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L162] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L163] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L163] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L164] var_1_19 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L165] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L166] var_1_21 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L167] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L168] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L168] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L169] var_1_32 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_32 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L170] RET assume_abort_if_not(var_1_32 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L171] CALL assume_abort_if_not(var_1_32 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L171] RET assume_abort_if_not(var_1_32 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L172] var_1_42 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L173] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L174] CALL assume_abort_if_not(var_1_42 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L174] RET assume_abort_if_not(var_1_42 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L190] RET updateVariables() [L191] CALL step() [L56] COND FALSE !(var_1_5 >= var_1_6) [L65] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L67] unsigned char stepLocal_1 = var_1_15; [L68] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L69] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L70] COND TRUE var_1_15 && stepLocal_1 [L71] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR var_1_13 >> var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR ((var_1_6) < ((var_1_13 >> var_1_5))) ? (var_1_6) : ((var_1_13 >> var_1_5)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR var_1_13 >> var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] EXPR ((var_1_6) < ((var_1_13 >> var_1_5))) ? (var_1_6) : ((var_1_13 >> var_1_5)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L76] COND FALSE !(var_1_6 < ((((var_1_6) < ((var_1_13 >> var_1_5))) ? (var_1_6) : ((var_1_13 >> var_1_5))))) [L85] COND FALSE !((var_1_5 - var_1_6) <= (~ (var_1_32 - var_1_8))) [L88] var_1_25 = -32 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L91] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L100] COND TRUE (var_1_11 / ((((var_1_42) > (256.5)) ? (var_1_42) : (256.5)))) < var_1_12 [L101] var_1_41 = var_1_5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L103] COND TRUE var_1_11 == var_1_18 [L104] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L106] COND TRUE var_1_8 >= -25 [L107] var_1_34 = var_1_16 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L109] COND TRUE (var_1_11 - var_1_12) >= (var_1_19 * var_1_12) [L110] var_1_36 = 5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L112] COND FALSE !((((((var_1_19) < (var_1_11)) ? (var_1_19) : (var_1_11))) >= (var_1_12 / var_1_42)) || var_1_16) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L117] EXPR var_1_1 & var_1_7 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L117] EXPR var_1_4 ^ (var_1_1 & var_1_7) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L117] COND TRUE var_1_5 <= (var_1_4 ^ (var_1_1 & var_1_7)) [L118] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L126] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=201/2] [L129] COND FALSE !((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) [L132] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=4294967300, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=4294967300] [L134] var_1_22 = var_1_12 [L135] var_1_23 = var_1_8 [L136] var_1_24 = var_1_6 [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=4294967300, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=4294967300, var_1_23=0, var_1_24=64, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=4294967300] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=4294967300, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=-1, var_1_21=-1, var_1_22=4294967300, var_1_23=0, var_1_24=64, var_1_25=-32, var_1_32=4294967295, var_1_34=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=127, var_1_5=0, var_1_6=64, var_1_7=0, var_1_8=0, var_1_9=4294967300] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 11, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3503 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3490 mSDsluCounter, 4167 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2965 mSDsCounter, 406 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2745 IncrementalHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 406 mSolverCounterUnsat, 1202 mSDtfsCounter, 2745 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1429 GetRequests, 1299 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=668occurred in iteration=9, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 395 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 2155 NumberOfCodeBlocks, 2155 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2294 ConstructedInterpolants, 0 QuantifiedInterpolants, 10849 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1132 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 14679/15180 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 07:27:05,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.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 a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:27:07,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:27:07,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:27:07,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:27:07,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:27:07,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:27:07,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:27:07,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:27:07,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:27:07,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:27:07,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:27:07,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:27:07,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:27:07,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:27:07,884 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:27:07,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:27:07,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:27:07,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:27:07,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:27:07,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:27:07,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:27:07,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:27:07,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:27:07,887 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:27:07,887 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:27:07,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:27:07,887 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:27:07,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:27:07,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:27:07,888 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:27:07,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:27:07,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:27:07,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:27:07,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:27:07,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:27:07,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:27:07,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:27:07,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:27:07,890 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:27:07,890 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:27:07,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:27:07,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:27:07,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:27:07,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:27:07,891 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:27:07,891 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 -> a731dee61f6e8731b14d03c15b42de9f4b4275aad2a5e7d49729c65ca9af6db7 [2024-10-24 07:27:08,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:27:08,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:27:08,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:27:08,198 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:27:08,198 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:27:08,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2024-10-24 07:27:09,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:27:10,018 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:27:10,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2024-10-24 07:27:10,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa1486ea/713de60a146b493991b63f2787b6a6c6/FLAG59a033e29 [2024-10-24 07:27:10,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa1486ea/713de60a146b493991b63f2787b6a6c6 [2024-10-24 07:27:10,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:27:10,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:27:10,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:27:10,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:27:10,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:27:10,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e84b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10, skipping insertion in model container [2024-10-24 07:27:10,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:27:10,222 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i[919,932] [2024-10-24 07:27:10,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:27:10,305 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:27:10,314 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i[919,932] [2024-10-24 07:27:10,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:27:10,367 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:27:10,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10 WrapperNode [2024-10-24 07:27:10,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:27:10,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:27:10,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:27:10,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:27:10,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,418 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-24 07:27:10,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:27:10,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:27:10,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:27:10,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:27:10,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,461 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 07:27:10,462 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:27:10,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:27:10,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:27:10,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:27:10,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (1/1) ... [2024-10-24 07:27:10,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:27:10,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:27:10,511 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 07:27:10,516 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 07:27:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:27:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:27:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:27:10,557 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:27:10,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:27:10,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:27:10,651 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:27:10,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:27:30,430 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-24 07:27:30,431 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:27:30,528 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:27:30,528 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:27:30,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:30 BoogieIcfgContainer [2024-10-24 07:27:30,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:27:30,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:27:30,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:27:30,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:27:30,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:27:10" (1/3) ... [2024-10-24 07:27:30,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8dd214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:27:30, skipping insertion in model container [2024-10-24 07:27:30,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:27:10" (2/3) ... [2024-10-24 07:27:30,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8dd214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:27:30, skipping insertion in model container [2024-10-24 07:27:30,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:27:30" (3/3) ... [2024-10-24 07:27:30,555 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-32.i [2024-10-24 07:27:30,567 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:27:30,567 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:27:30,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:27:30,634 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;@79f48e94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:27:30,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:27:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 48 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 07:27:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 07:27:30,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:30,651 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:30,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:30,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash -528789016, now seen corresponding path program 1 times [2024-10-24 07:27:30,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:27:30,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296931870] [2024-10-24 07:27:30,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:30,668 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 07:27:30,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:27:30,671 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 07:27:30,687 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 07:27:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:32,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 07:27:32,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-24 07:27:32,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:27:32,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:27:32,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296931870] [2024-10-24 07:27:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296931870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:27:32,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:27:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:27:32,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529985043] [2024-10-24 07:27:32,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:27:32,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:27:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:27:32,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:27:32,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:27:32,172 INFO L87 Difference]: Start difference. First operand has 73 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 48 states have internal predecessors, (75), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 07:27:33,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:33,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:27:33,907 INFO L93 Difference]: Finished difference Result 141 states and 259 transitions. [2024-10-24 07:27:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:27:33,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2024-10-24 07:27:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:27:33,944 INFO L225 Difference]: With dead ends: 141 [2024-10-24 07:27:33,944 INFO L226 Difference]: Without dead ends: 69 [2024-10-24 07:27:33,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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 07:27:33,948 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:27:33,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 07:27:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-24 07:27:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-24 07:27:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 44 states have internal predecessors, (64), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 07:27:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 110 transitions. [2024-10-24 07:27:33,983 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 110 transitions. Word has length 147 [2024-10-24 07:27:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:27:33,983 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 110 transitions. [2024-10-24 07:27:33,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 07:27:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 110 transitions. [2024-10-24 07:27:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-24 07:27:34,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:27:34,006 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:27:34,039 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 07:27:34,206 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 07:27:34,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:27:34,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:27:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1154434782, now seen corresponding path program 1 times [2024-10-24 07:27:34,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:27:34,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161530944] [2024-10-24 07:27:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:27:34,209 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 07:27:34,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:27:34,212 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 07:27:34,212 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 07:27:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:27:35,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 07:27:35,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:27:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 42 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2024-10-24 07:27:40,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:27:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-24 07:27:44,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:27:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161530944] [2024-10-24 07:27:44,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161530944] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:27:44,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 07:27:44,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-10-24 07:27:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686069601] [2024-10-24 07:27:44,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 07:27:44,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 07:27:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:27:44,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 07:27:44,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-24 07:27:44,942 INFO L87 Difference]: Start difference. First operand 69 states and 110 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-24 07:27:55,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:27:59,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:28:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:28:07,666 INFO L93 Difference]: Finished difference Result 328 states and 500 transitions. [2024-10-24 07:28:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-24 07:28:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 147 [2024-10-24 07:28:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:28:07,673 INFO L225 Difference]: With dead ends: 328 [2024-10-24 07:28:07,673 INFO L226 Difference]: Without dead ends: 260 [2024-10-24 07:28:07,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 07:28:07,679 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 292 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-10-24 07:28:07,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 585 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 16.7s Time] [2024-10-24 07:28:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-10-24 07:28:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 247. [2024-10-24 07:28:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 155 states have internal predecessors, (205), 83 states have call successors, (83), 9 states have call predecessors, (83), 9 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2024-10-24 07:28:07,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 371 transitions. [2024-10-24 07:28:07,738 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 371 transitions. Word has length 147 [2024-10-24 07:28:07,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:28:07,739 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 371 transitions. [2024-10-24 07:28:07,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-10-24 07:28:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 371 transitions. [2024-10-24 07:28:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 07:28:07,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:28:07,741 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:28:07,779 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 07:28:07,945 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 07:28:07,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:28:07,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:28:07,947 INFO L85 PathProgramCache]: Analyzing trace with hash 127595486, now seen corresponding path program 1 times [2024-10-24 07:28:07,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:28:07,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757103801] [2024-10-24 07:28:07,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:28:07,951 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 07:28:07,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:28:07,953 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 07:28:07,957 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 07:28:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:28:09,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 07:28:09,441 INFO L278 TraceCheckSpWp]: Computing forward predicates...