./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-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e18f66b8e050d748e58172ad369a99abf96303f1ce2c22e887e3d1776b423830 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:30:54,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:30:54,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:30:54,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:30:54,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:30:54,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:30:54,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:30:54,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:30:54,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:30:54,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:30:54,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:30:54,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:30:54,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:30:54,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:30:54,184 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:30:54,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:30:54,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:30:54,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:30:54,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:30:54,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:30:54,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:30:54,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:30:54,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:30:54,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:30:54,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:30:54,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:30:54,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:30:54,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:30:54,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:30:54,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:30:54,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:30:54,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:30:54,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:30:54,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:30:54,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:30:54,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:30:54,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:30:54,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:30:54,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:30:54,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:30:54,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:30:54,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:30:54,195 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e18f66b8e050d748e58172ad369a99abf96303f1ce2c22e887e3d1776b423830 [2024-10-11 09:30:54,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:30:54,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:30:54,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:30:54,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:30:54,496 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:30:54,497 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-61.i [2024-10-11 09:30:55,980 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:30:56,205 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:30:56,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i [2024-10-11 09:30:56,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/88b635012/e7444e49e9ff49dfbeb2662e3da36d34/FLAG0c6bc7f57 [2024-10-11 09:30:56,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/88b635012/e7444e49e9ff49dfbeb2662e3da36d34 [2024-10-11 09:30:56,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:30:56,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:30:56,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:30:56,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:30:56,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:30:56,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f0bed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56, skipping insertion in model container [2024-10-11 09:30:56,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:30:56,466 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-61.i[919,932] [2024-10-11 09:30:56,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:30:56,561 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:30:56,575 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-61.i[919,932] [2024-10-11 09:30:56,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:30:56,631 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:30:56,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56 WrapperNode [2024-10-11 09:30:56,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:30:56,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:30:56,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:30:56,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:30:56,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,706 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-11 09:30:56,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:30:56,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:30:56,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:30:56,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:30:56,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,747 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:30:56,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:30:56,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:30:56,784 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:30:56,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:30:56,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (1/1) ... [2024-10-11 09:30:56,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:30:56,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:56,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:30:56,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:30:56,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:30:56,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:30:56,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:30:56,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:30:56,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:30:56,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:30:56,982 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:30:56,986 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:30:57,478 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 09:30:57,479 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:30:57,524 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:30:57,524 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:30:57,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:57 BoogieIcfgContainer [2024-10-11 09:30:57,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:30:57,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:30:57,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:30:57,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:30:57,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:30:56" (1/3) ... [2024-10-11 09:30:57,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2890ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:57, skipping insertion in model container [2024-10-11 09:30:57,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:56" (2/3) ... [2024-10-11 09:30:57,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2890ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:57, skipping insertion in model container [2024-10-11 09:30:57,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:57" (3/3) ... [2024-10-11 09:30:57,535 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i [2024-10-11 09:30:57,555 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:30:57,555 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:30:57,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:30:57,620 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;@c014229, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:30:57,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:30:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 70 states have (on average 1.542857142857143) internal successors, (108), 71 states have internal predecessors, (108), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:30:57,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 09:30:57,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:57,641 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:57,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:57,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:57,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2114259866, now seen corresponding path program 1 times [2024-10-11 09:30:57,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:57,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384555859] [2024-10-11 09:30:57,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:57,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:57,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:57,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:57,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:57,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:57,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:57,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:30:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:30:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:30:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:30:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:30:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:30:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:30:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:30:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:30:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:30:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:30:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:30:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:30:58,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:58,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384555859] [2024-10-11 09:30:58,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384555859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:58,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:58,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:30:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456178125] [2024-10-11 09:30:58,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:58,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:30:58,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:58,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:30:58,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:30:58,180 INFO L87 Difference]: Start difference. First operand has 97 states, 70 states have (on average 1.542857142857143) internal successors, (108), 71 states have internal predecessors, (108), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:30:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:58,241 INFO L93 Difference]: Finished difference Result 191 states and 334 transitions. [2024-10-11 09:30:58,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:30:58,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2024-10-11 09:30:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:58,255 INFO L225 Difference]: With dead ends: 191 [2024-10-11 09:30:58,256 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 09:30:58,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:30:58,266 INFO L432 NwaCegarLoop]: 146 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, 146 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:58,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:30:58,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 09:30:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 09:30:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.463768115942029) internal successors, (101), 69 states have internal predecessors, (101), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:30:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2024-10-11 09:30:58,335 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 149 transitions. Word has length 162 [2024-10-11 09:30:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:58,336 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 149 transitions. [2024-10-11 09:30:58,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:30:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 149 transitions. [2024-10-11 09:30:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 09:30:58,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:58,344 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:58,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:30:58,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:58,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1447942998, now seen corresponding path program 1 times [2024-10-11 09:30:58,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:58,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240418163] [2024-10-11 09:30:58,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:58,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:30:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:30:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:30:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:30:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:30:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:30:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:30:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:30:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:30:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:30:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:30:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:30:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:30:58,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:58,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240418163] [2024-10-11 09:30:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240418163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:58,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:58,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:30:58,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500377198] [2024-10-11 09:30:58,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:58,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:30:58,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:58,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:30:58,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:30:58,789 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:30:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:58,837 INFO L93 Difference]: Finished difference Result 189 states and 297 transitions. [2024-10-11 09:30:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:30:58,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-11 09:30:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:58,845 INFO L225 Difference]: With dead ends: 189 [2024-10-11 09:30:58,845 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 09:30:58,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:30:58,851 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:58,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:30:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 09:30:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 09:30:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 69 states have internal predecessors, (100), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:30:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 148 transitions. [2024-10-11 09:30:58,873 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 148 transitions. Word has length 162 [2024-10-11 09:30:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:58,875 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 148 transitions. [2024-10-11 09:30:58,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:30:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 148 transitions. [2024-10-11 09:30:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 09:30:58,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:58,878 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:58,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:30:58,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:58,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash -923796264, now seen corresponding path program 1 times [2024-10-11 09:30:58,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:58,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351112230] [2024-10-11 09:30:58,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:58,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:30:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:30:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:30:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:30:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:30:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:30:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:30:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:30:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:30:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:30:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:30:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:30:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:30:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:30:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:30:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:30:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:30:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:30:59,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:59,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351112230] [2024-10-11 09:30:59,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351112230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:59,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:59,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:30:59,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080350441] [2024-10-11 09:30:59,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:59,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:30:59,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:59,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:30:59,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:30:59,663 INFO L87 Difference]: Start difference. First operand 95 states and 148 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:30:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:59,919 INFO L93 Difference]: Finished difference Result 189 states and 295 transitions. [2024-10-11 09:30:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:30:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-11 09:30:59,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:59,924 INFO L225 Difference]: With dead ends: 189 [2024-10-11 09:30:59,924 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 09:30:59,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:30:59,929 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 102 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:59,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 226 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:30:59,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 09:30:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 09:30:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:30:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions. [2024-10-11 09:30:59,955 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 162 [2024-10-11 09:30:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:59,956 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 147 transitions. [2024-10-11 09:30:59,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:30:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 147 transitions. [2024-10-11 09:30:59,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 09:30:59,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:59,964 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:30:59,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:30:59,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:59,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:59,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1741444714, now seen corresponding path program 1 times [2024-10-11 09:30:59,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:59,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612561042] [2024-10-11 09:30:59,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:59,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:31:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:31:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:31:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:31:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:31:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:31:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:31:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:31:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:31:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:31:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:31:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:31:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:31:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:31:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:31:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:31:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:31:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:31:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:31:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:31:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:31:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:31:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:31:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:31:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:31:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:31:00,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:31:00,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612561042] [2024-10-11 09:31:00,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612561042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:31:00,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:31:00,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:31:00,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216752691] [2024-10-11 09:31:00,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:31:00,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:31:00,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:31:00,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:31:00,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:31:00,493 INFO L87 Difference]: Start difference. First operand 95 states and 147 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:00,939 INFO L93 Difference]: Finished difference Result 280 states and 434 transitions. [2024-10-11 09:31:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:31:00,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-11 09:31:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:00,942 INFO L225 Difference]: With dead ends: 280 [2024-10-11 09:31:00,942 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 09:31:00,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 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-11 09:31:00,944 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 307 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:00,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 316 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:31:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 09:31:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 133. [2024-10-11 09:31:00,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:31:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 208 transitions. [2024-10-11 09:31:00,976 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 208 transitions. Word has length 162 [2024-10-11 09:31:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:00,977 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 208 transitions. [2024-10-11 09:31:00,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 208 transitions. [2024-10-11 09:31:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 09:31:00,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:00,981 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:00,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:31:00,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:00,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash 748084248, now seen corresponding path program 1 times [2024-10-11 09:31:00,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:31:00,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040041895] [2024-10-11 09:31:00,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:00,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:31:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:31:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:31:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:31:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:31:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:31:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:31:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:31:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:31:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:31:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:31:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:31:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:31:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:31:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:31:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:31:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:31:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:31:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:31:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:31:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:31:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:31:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:31:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:31:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:31:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:31:01,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:31:01,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040041895] [2024-10-11 09:31:01,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040041895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:31:01,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:31:01,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:31:01,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85776021] [2024-10-11 09:31:01,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:31:01,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:31:01,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:31:01,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:31:01,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:31:01,276 INFO L87 Difference]: Start difference. First operand 133 states and 208 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:01,445 INFO L93 Difference]: Finished difference Result 318 states and 491 transitions. [2024-10-11 09:31:01,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:31:01,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-10-11 09:31:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:01,448 INFO L225 Difference]: With dead ends: 318 [2024-10-11 09:31:01,448 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 09:31:01,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:31:01,450 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 122 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:01,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 406 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:31:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 09:31:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 133. [2024-10-11 09:31:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.485981308411215) internal successors, (159), 107 states have internal predecessors, (159), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:31:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 207 transitions. [2024-10-11 09:31:01,502 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 207 transitions. Word has length 162 [2024-10-11 09:31:01,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:01,504 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 207 transitions. [2024-10-11 09:31:01,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 207 transitions. [2024-10-11 09:31:01,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 09:31:01,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:01,508 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:01,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:31:01,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:01,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:01,509 INFO L85 PathProgramCache]: Analyzing trace with hash 598265624, now seen corresponding path program 1 times [2024-10-11 09:31:01,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:31:01,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723426483] [2024-10-11 09:31:01,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:01,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:31:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:31:01,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272358407] [2024-10-11 09:31:01,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:01,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:31:01,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:31:01,625 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:31:01,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:31:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:01,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 09:31:01,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:31:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:31:02,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:31:02,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:31:02,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723426483] [2024-10-11 09:31:02,444 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:31:02,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272358407] [2024-10-11 09:31:02,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272358407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:31:02,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:31:02,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:31:02,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23416640] [2024-10-11 09:31:02,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:31:02,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:31:02,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:31:02,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:31:02,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:31:02,447 INFO L87 Difference]: Start difference. First operand 133 states and 207 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:02,513 INFO L93 Difference]: Finished difference Result 265 states and 413 transitions. [2024-10-11 09:31:02,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:31:02,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2024-10-11 09:31:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:02,515 INFO L225 Difference]: With dead ends: 265 [2024-10-11 09:31:02,515 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 09:31:02,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:31:02,517 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:02,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 122 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:31:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 09:31:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-11 09:31:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 107 states have internal predecessors, (157), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:31:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 205 transitions. [2024-10-11 09:31:02,546 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 205 transitions. Word has length 164 [2024-10-11 09:31:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:02,547 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 205 transitions. [2024-10-11 09:31:02,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 205 transitions. [2024-10-11 09:31:02,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 09:31:02,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:02,549 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:02,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:31:02,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:31:02,750 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:02,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:02,751 INFO L85 PathProgramCache]: Analyzing trace with hash -413940218, now seen corresponding path program 1 times [2024-10-11 09:31:02,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:31:02,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102452034] [2024-10-11 09:31:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:02,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:31:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:31:02,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [511006055] [2024-10-11 09:31:02,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:02,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:31:02,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:31:02,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:31:02,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:31:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:03,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:31:03,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:31:04,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 465 proven. 18 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-10-11 09:31:04,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:31:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:31:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102452034] [2024-10-11 09:31:07,084 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 09:31:07,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511006055] [2024-10-11 09:31:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511006055] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:31:07,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:31:07,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-10-11 09:31:07,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475339916] [2024-10-11 09:31:07,085 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 09:31:07,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:31:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:31:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:31:07,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=81, Unknown=5, NotChecked=0, Total=110 [2024-10-11 09:31:07,087 INFO L87 Difference]: Start difference. First operand 133 states and 205 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:31:08,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:08,175 INFO L93 Difference]: Finished difference Result 277 states and 417 transitions. [2024-10-11 09:31:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 09:31:08,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2024-10-11 09:31:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:08,179 INFO L225 Difference]: With dead ends: 277 [2024-10-11 09:31:08,179 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 09:31:08,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=272, Unknown=5, NotChecked=0, Total=380 [2024-10-11 09:31:08,180 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 218 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 101 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:08,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 378 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 174 Invalid, 53 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 09:31:08,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 09:31:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2024-10-11 09:31:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 111 states have (on average 1.4144144144144144) internal successors, (157), 111 states have internal predecessors, (157), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:31:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 205 transitions. [2024-10-11 09:31:08,217 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 205 transitions. Word has length 165 [2024-10-11 09:31:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:08,217 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 205 transitions. [2024-10-11 09:31:08,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:31:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 205 transitions. [2024-10-11 09:31:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 09:31:08,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:08,219 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:08,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 09:31:08,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:31:08,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:08,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash 103212806, now seen corresponding path program 1 times [2024-10-11 09:31:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:31:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589339595] [2024-10-11 09:31:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:08,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:31:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:31:08,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50869415] [2024-10-11 09:31:08,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:08,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:31:08,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:31:08,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:31:08,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:31:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:31:08,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:31:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:31:08,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:31:08,840 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:31:08,841 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:31:08,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 09:31:09,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:31:09,048 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:09,166 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:31:09,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:31:09 BoogieIcfgContainer [2024-10-11 09:31:09,169 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:31:09,170 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:31:09,170 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:31:09,170 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:31:09,171 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:57" (3/4) ... [2024-10-11 09:31:09,173 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:31:09,174 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:31:09,174 INFO L158 Benchmark]: Toolchain (without parser) took 12935.10ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 120.3MB in the beginning and 219.7MB in the end (delta: -99.4MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-10-11 09:31:09,174 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:31:09,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.85ms. Allocated memory is still 176.2MB. Free memory was 119.7MB in the beginning and 103.5MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 09:31:09,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.87ms. Allocated memory is still 176.2MB. Free memory was 103.5MB in the beginning and 100.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:31:09,175 INFO L158 Benchmark]: Boogie Preprocessor took 71.89ms. Allocated memory is still 176.2MB. Free memory was 100.3MB in the beginning and 96.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:31:09,176 INFO L158 Benchmark]: RCFGBuilder took 741.52ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 96.1MB in the beginning and 196.4MB in the end (delta: -100.3MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2024-10-11 09:31:09,176 INFO L158 Benchmark]: TraceAbstraction took 11641.95ms. Allocated memory was 230.7MB in the beginning and 276.8MB in the end (delta: 46.1MB). Free memory was 195.4MB in the beginning and 220.7MB in the end (delta: -25.3MB). Peak memory consumption was 164.3MB. Max. memory is 16.1GB. [2024-10-11 09:31:09,176 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 276.8MB. Free memory was 220.7MB in the beginning and 219.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 09:31:09,177 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.18ms. Allocated memory is still 176.2MB. Free memory is still 138.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.85ms. Allocated memory is still 176.2MB. Free memory was 119.7MB in the beginning and 103.5MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.87ms. Allocated memory is still 176.2MB. Free memory was 103.5MB in the beginning and 100.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.89ms. Allocated memory is still 176.2MB. Free memory was 100.3MB in the beginning and 96.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 741.52ms. Allocated memory was 176.2MB in the beginning and 230.7MB in the end (delta: 54.5MB). Free memory was 96.1MB in the beginning and 196.4MB in the end (delta: -100.3MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * TraceAbstraction took 11641.95ms. Allocated memory was 230.7MB in the beginning and 276.8MB in the end (delta: 46.1MB). Free memory was 195.4MB in the beginning and 220.7MB in the end (delta: -25.3MB). Peak memory consumption was 164.3MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 276.8MB. Free memory was 220.7MB in the beginning and 219.7MB 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 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryArithmeticDOUBLEoperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] unsigned long int var_1_24 = 2; [L41] unsigned long int var_1_26 = 1; [L42] double var_1_33 = 1.5; [L43] double var_1_35 = 50.5; [L44] double var_1_36 = 1.9; [L45] unsigned long int var_1_37 = 10000; [L46] unsigned char var_1_38 = 1; [L47] unsigned char var_1_39 = 0; [L48] double var_1_40 = 15.5; [L49] unsigned long int var_1_42 = 128; [L50] signed char var_1_43 = -1; [L51] signed long int last_1_var_1_9 = -50; [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L182] last_1_var_1_9 = var_1_9 [L192] RET updateLastVariables() [L193] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_ulong() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L146] var_1_6 = __VERIFIER_nondet_ulong() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L149] var_1_8 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L150] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L151] var_1_14 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L154] var_1_15 = __VERIFIER_nondet_ulong() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L157] var_1_16 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L161] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L163] var_1_18 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L164] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L170] var_1_23 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L171] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L173] var_1_35 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L174] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L175] var_1_36 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L176] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L193] RET updateVariables() [L194] CALL step() [L55] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L56] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=50, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L59] var_1_21 = var_1_6 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L60] COND FALSE !((var_1_35 <= 64.5) && var_1_18) [L63] var_1_40 = var_1_36 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=-4, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L65] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L66] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L69] COND TRUE \read(var_1_17) [L70] var_1_43 = ((((((((-16) < 0 ) ? -(-16) : (-16)))) > (var_1_23)) ? (((((-16) < 0 ) ? -(-16) : (-16)))) : (var_1_23))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L72] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L73] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L76] COND TRUE var_1_20 < ((var_1_4 + 16u) * var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L77] COND FALSE !(var_1_18 && (var_1_35 < var_1_36)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=128, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L85] COND TRUE var_1_16 < var_1_9 [L86] var_1_42 = ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L88] signed long int stepLocal_3 = var_1_9; [L89] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=2147483647, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L90] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=2147483647, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L90] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L91] COND FALSE !(var_1_9 <= stepLocal_2) [L100] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L102] var_1_24 = var_1_5 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=1, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L103] COND FALSE !(var_1_5 != var_1_14) [L110] var_1_26 = 16u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L112] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L119] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_33=3/2, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L121] COND TRUE \read(var_1_13) [L122] var_1_33 = (var_1_35 - var_1_36) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L124] COND FALSE !(var_1_35 >= var_1_8) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L129] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=0, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L130] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L131] COND TRUE \read(var_1_13) [L132] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L185] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L185-L186] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=2147483647, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=9, var_1_21=0, var_1_22=17, var_1_23=17, var_1_24=2147483647, var_1_26=16, var_1_36=2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=2, var_1_42=0, var_1_43=17, var_1_4=1, var_1_5=2147483647, var_1_6=0, var_1_7=3, var_1_8=3, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 53 mSolverCounterUnknown, 821 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 821 mSDsluCounter, 1880 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 839 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 440 IncrementalHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 1041 mSDtfsCounter, 440 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 657 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 112 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1798 NumberOfCodeBlocks, 1798 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1132 ConstructedInterpolants, 1 QuantifiedInterpolants, 4365 SizeOfPredicates, 3 NumberOfNonLiveVariables, 757 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 7710/7728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 09:31:09,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e18f66b8e050d748e58172ad369a99abf96303f1ce2c22e887e3d1776b423830 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:31:11,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:31:11,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:31:11,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:31:11,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:31:11,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:31:11,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:31:11,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:31:11,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:31:11,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:31:11,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:31:11,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:31:11,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:31:11,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:31:11,631 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:31:11,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:31:11,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:31:11,632 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:31:11,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:31:11,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:31:11,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:31:11,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:31:11,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:31:11,634 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:31:11,634 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:31:11,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:31:11,635 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:31:11,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:31:11,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:31:11,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:31:11,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:31:11,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:31:11,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:31:11,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:31:11,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:31:11,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:31:11,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:31:11,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:31:11,638 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:31:11,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:31:11,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:31:11,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:31:11,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:31:11,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:31:11,640 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:31:11,640 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e18f66b8e050d748e58172ad369a99abf96303f1ce2c22e887e3d1776b423830 [2024-10-11 09:31:11,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:31:11,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:31:11,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:31:12,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:31:12,001 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:31:12,003 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-61.i [2024-10-11 09:31:13,482 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:31:13,690 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:31:13,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i [2024-10-11 09:31:13,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6abbaa418/f152ac8711bc4d2cb3605a3481b24012/FLAGd506cad40 [2024-10-11 09:31:14,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6abbaa418/f152ac8711bc4d2cb3605a3481b24012 [2024-10-11 09:31:14,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:31:14,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:31:14,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:31:14,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:31:14,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:31:14,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bcc9b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14, skipping insertion in model container [2024-10-11 09:31:14,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:31:14,306 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-61.i[919,932] [2024-10-11 09:31:14,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:31:14,405 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:31:14,421 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-61.i[919,932] [2024-10-11 09:31:14,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:31:14,494 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:31:14,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14 WrapperNode [2024-10-11 09:31:14,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:31:14,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:31:14,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:31:14,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:31:14,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,562 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-11 09:31:14,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:31:14,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:31:14,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:31:14,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:31:14,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,610 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:31:14,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:31:14,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:31:14,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:31:14,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:31:14,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (1/1) ... [2024-10-11 09:31:14,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:31:14,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:31:14,704 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:31:14,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:31:14,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:31:14,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:31:14,750 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:31:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:31:14,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:31:14,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:31:14,833 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:31:14,835 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:31:15,770 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 09:31:15,771 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:31:15,815 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:31:15,816 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:31:15,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:31:15 BoogieIcfgContainer [2024-10-11 09:31:15,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:31:15,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:31:15,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:31:15,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:31:15,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:31:14" (1/3) ... [2024-10-11 09:31:15,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3e339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:31:15, skipping insertion in model container [2024-10-11 09:31:15,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:31:14" (2/3) ... [2024-10-11 09:31:15,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c3e339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:31:15, skipping insertion in model container [2024-10-11 09:31:15,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:31:15" (3/3) ... [2024-10-11 09:31:15,828 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-61.i [2024-10-11 09:31:15,845 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:31:15,846 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:31:15,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:31:15,913 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;@6029dc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:31:15,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:31:15,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 53 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:31:15,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 09:31:15,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:15,934 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:15,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:15,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:15,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1403442025, now seen corresponding path program 1 times [2024-10-11 09:31:15,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:31:15,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091533405] [2024-10-11 09:31:15,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:15,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:15,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:31:15,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:31:15,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 09:31:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:16,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:31:16,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:31:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-11 09:31:16,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:31:16,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:31:16,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091533405] [2024-10-11 09:31:16,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091533405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:31:16,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:31:16,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:31:16,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513147715] [2024-10-11 09:31:16,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:31:16,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:31:16,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:31:16,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:31:16,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:31:16,496 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 53 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:31:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:16,681 INFO L93 Difference]: Finished difference Result 155 states and 278 transitions. [2024-10-11 09:31:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:31:16,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 158 [2024-10-11 09:31:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:16,699 INFO L225 Difference]: With dead ends: 155 [2024-10-11 09:31:16,700 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 09:31:16,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:31:16,707 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:16,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:31:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 09:31:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 09:31:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:31:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2024-10-11 09:31:16,753 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 123 transitions. Word has length 158 [2024-10-11 09:31:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:16,754 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 123 transitions. [2024-10-11 09:31:16,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 09:31:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 123 transitions. [2024-10-11 09:31:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 09:31:16,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:16,758 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:16,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 09:31:16,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:16,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:16,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:16,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2036654373, now seen corresponding path program 1 times [2024-10-11 09:31:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:31:16,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392984597] [2024-10-11 09:31:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:16,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:16,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:31:16,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:31:16,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 09:31:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:17,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 09:31:17,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:31:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:31:18,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:31:18,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:31:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392984597] [2024-10-11 09:31:18,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392984597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:31:18,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:31:18,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:31:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518597618] [2024-10-11 09:31:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:31:18,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:31:18,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:31:18,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:31:18,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:31:18,005 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:18,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:18,909 INFO L93 Difference]: Finished difference Result 256 states and 412 transitions. [2024-10-11 09:31:18,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:31:18,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-11 09:31:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:18,922 INFO L225 Difference]: With dead ends: 256 [2024-10-11 09:31:18,922 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 09:31:18,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:31:18,925 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 128 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:18,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 470 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 09:31:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 09:31:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2024-10-11 09:31:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.47) internal successors, (147), 100 states have internal predecessors, (147), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 09:31:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 243 transitions. [2024-10-11 09:31:18,962 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 243 transitions. Word has length 158 [2024-10-11 09:31:18,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:18,963 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 243 transitions. [2024-10-11 09:31:18,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 243 transitions. [2024-10-11 09:31:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 09:31:18,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:18,973 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:18,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 09:31:19,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:19,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:19,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:19,175 INFO L85 PathProgramCache]: Analyzing trace with hash 231216039, now seen corresponding path program 1 times [2024-10-11 09:31:19,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:31:19,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18031560] [2024-10-11 09:31:19,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:19,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:19,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:31:19,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:31:19,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 09:31:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:19,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 09:31:19,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:31:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:31:19,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:31:19,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:31:19,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18031560] [2024-10-11 09:31:19,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18031560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:31:19,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:31:19,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:31:19,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690504034] [2024-10-11 09:31:19,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:31:19,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:31:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:31:19,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:31:19,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:31:19,965 INFO L87 Difference]: Start difference. First operand 151 states and 243 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:20,437 INFO L93 Difference]: Finished difference Result 153 states and 244 transitions. [2024-10-11 09:31:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:31:20,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-11 09:31:20,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:20,449 INFO L225 Difference]: With dead ends: 153 [2024-10-11 09:31:20,449 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 09:31:20,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:31:20,451 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 48 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:20,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 176 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:31:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 09:31:20,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 09:31:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 51 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:31:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 121 transitions. [2024-10-11 09:31:20,474 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 121 transitions. Word has length 158 [2024-10-11 09:31:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:20,475 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 121 transitions. [2024-10-11 09:31:20,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 121 transitions. [2024-10-11 09:31:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 09:31:20,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:20,481 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:20,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 09:31:20,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:20,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:20,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:20,682 INFO L85 PathProgramCache]: Analyzing trace with hash -789852315, now seen corresponding path program 1 times [2024-10-11 09:31:20,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:31:20,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462468216] [2024-10-11 09:31:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:20,683 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:20,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:31:20,687 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:31:20,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 09:31:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:20,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 09:31:20,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:31:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 09:31:22,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:31:22,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:31:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462468216] [2024-10-11 09:31:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462468216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:31:22,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:31:22,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:31:22,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460940918] [2024-10-11 09:31:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:31:22,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:31:22,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:31:22,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:31:22,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:31:22,052 INFO L87 Difference]: Start difference. First operand 77 states and 121 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:22,279 INFO L93 Difference]: Finished difference Result 153 states and 241 transitions. [2024-10-11 09:31:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:31:22,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-11 09:31:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:22,292 INFO L225 Difference]: With dead ends: 153 [2024-10-11 09:31:22,292 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 09:31:22,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:31:22,294 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:22,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 102 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:31:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 09:31:22,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 09:31:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 09:31:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 120 transitions. [2024-10-11 09:31:22,321 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 120 transitions. Word has length 158 [2024-10-11 09:31:22,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:22,323 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 120 transitions. [2024-10-11 09:31:22,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 09:31:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 120 transitions. [2024-10-11 09:31:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 09:31:22,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:22,326 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:31:22,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 09:31:22,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:22,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:22,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:22,529 INFO L85 PathProgramCache]: Analyzing trace with hash -2101954921, now seen corresponding path program 1 times [2024-10-11 09:31:22,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:31:22,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044803217] [2024-10-11 09:31:22,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:22,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:22,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:31:22,531 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:31:22,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 09:31:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:22,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 09:31:22,873 INFO L278 TraceCheckSpWp]: Computing forward predicates...