./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-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8764d0703f262f882fea925b2e1c51288e3d3f7182d2157f47a63a3f8cbf94f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:32:53,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:32:53,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:32:53,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:32:53,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:32:53,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:32:53,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:32:53,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:32:53,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:32:53,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:32:53,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:32:53,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:32:53,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:32:53,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:32:53,167 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:32:53,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:32:53,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:32:53,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:32:53,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:32:53,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:32:53,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:32:53,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:32:53,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:32:53,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:32:53,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:32:53,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:32:53,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:32:53,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:32:53,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:32:53,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:32:53,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:32:53,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:32:53,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:32:53,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:32:53,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:32:53,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:32:53,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:32:53,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:32:53,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:32:53,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:32:53,185 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:32:53,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:32:53,185 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8764d0703f262f882fea925b2e1c51288e3d3f7182d2157f47a63a3f8cbf94f [2024-11-20 04:32:53,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:32:53,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:32:53,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:32:53,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:32:53,427 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:32:53,427 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-20.i [2024-11-20 04:32:54,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:32:54,894 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:32:54,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i [2024-11-20 04:32:54,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e50fdd86d/8e1b5037485e4a0285eb45322670d09d/FLAG3be415860 [2024-11-20 04:32:55,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e50fdd86d/8e1b5037485e4a0285eb45322670d09d [2024-11-20 04:32:55,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:32:55,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:32:55,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:32:55,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:32:55,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:32:55,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534ab605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55, skipping insertion in model container [2024-11-20 04:32:55,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:32:55,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i[919,932] [2024-11-20 04:32:55,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:32:55,540 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:32:55,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i[919,932] [2024-11-20 04:32:55,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:32:55,621 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:32:55,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55 WrapperNode [2024-11-20 04:32:55,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:32:55,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:32:55,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:32:55,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:32:55,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,691 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-20 04:32:55,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:32:55,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:32:55,693 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:32:55,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:32:55,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,731 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 04:32:55,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:32:55,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:32:55,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:32:55,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:32:55,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (1/1) ... [2024-11-20 04:32:55,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:32:55,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:32:55,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 04:32:55,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 04:32:55,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:32:55,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:32:55,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:32:55,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:32:55,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:32:55,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:32:55,952 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:32:55,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:32:56,352 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-20 04:32:56,354 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:32:56,367 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:32:56,368 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:32:56,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:32:56 BoogieIcfgContainer [2024-11-20 04:32:56,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:32:56,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:32:56,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:32:56,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:32:56,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:32:55" (1/3) ... [2024-11-20 04:32:56,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bd4ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:32:56, skipping insertion in model container [2024-11-20 04:32:56,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:32:55" (2/3) ... [2024-11-20 04:32:56,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36bd4ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:32:56, skipping insertion in model container [2024-11-20 04:32:56,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:32:56" (3/3) ... [2024-11-20 04:32:56,378 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i [2024-11-20 04:32:56,392 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:32:56,392 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:32:56,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:32:56,455 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;@1008b7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:32:56,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:32:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 04:32:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 04:32:56,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:32:56,469 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:32:56,470 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:32:56,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:32:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1809289617, now seen corresponding path program 1 times [2024-11-20 04:32:56,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:32:56,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203879642] [2024-11-20 04:32:56,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:32:56,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:32:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:32:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:32:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:32:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:32:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:32:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:32:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:32:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:32:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:32:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:32:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:32:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:32:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:32:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:32:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:32:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:32:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:32:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:32:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:32:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:32:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:32:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:56,874 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 04:32:56,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:32:56,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203879642] [2024-11-20 04:32:56,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203879642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:32:56,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:32:56,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:32:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757454130] [2024-11-20 04:32:56,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:32:56,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:32:56,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:32:56,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:32:56,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:32:56,915 INFO L87 Difference]: Start difference. First operand has 86 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 04:32:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:32:56,945 INFO L93 Difference]: Finished difference Result 165 states and 279 transitions. [2024-11-20 04:32:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:32:56,947 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 144 [2024-11-20 04:32:56,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:32:56,953 INFO L225 Difference]: With dead ends: 165 [2024-11-20 04:32:56,954 INFO L226 Difference]: Without dead ends: 82 [2024-11-20 04:32:56,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:32:56,960 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:32:56,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:32:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-20 04:32:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-20 04:32:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 59 states have internal predecessors, (83), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 04:32:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-11-20 04:32:57,057 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 144 [2024-11-20 04:32:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:32:57,057 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-11-20 04:32:57,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 04:32:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-11-20 04:32:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 04:32:57,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:32:57,065 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:32:57,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:32:57,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:32:57,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:32:57,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1441247221, now seen corresponding path program 1 times [2024-11-20 04:32:57,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:32:57,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9837509] [2024-11-20 04:32:57,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:32:57,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:32:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:32:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:32:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:32:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:32:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:32:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:32:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:32:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:32:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:32:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:32:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:32:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:32:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:32:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:32:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:32:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:32:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:32:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:32:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:32:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:32:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:32:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 04:32:57,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:32:57,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9837509] [2024-11-20 04:32:57,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9837509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:32:57,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:32:57,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:32:57,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258840398] [2024-11-20 04:32:57,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:32:57,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:32:57,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:32:57,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:32:57,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:32:57,350 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 04:32:57,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:32:57,433 INFO L93 Difference]: Finished difference Result 198 states and 303 transitions. [2024-11-20 04:32:57,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:32:57,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 144 [2024-11-20 04:32:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:32:57,435 INFO L225 Difference]: With dead ends: 198 [2024-11-20 04:32:57,435 INFO L226 Difference]: Without dead ends: 119 [2024-11-20 04:32:57,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:32:57,437 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 47 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:32:57,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 219 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:32:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-20 04:32:57,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2024-11-20 04:32:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 04:32:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2024-11-20 04:32:57,448 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 144 [2024-11-20 04:32:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:32:57,449 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-11-20 04:32:57,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 04:32:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2024-11-20 04:32:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 04:32:57,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:32:57,452 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:32:57,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:32:57,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:32:57,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:32:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash -102117299, now seen corresponding path program 1 times [2024-11-20 04:32:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:32:57,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074758730] [2024-11-20 04:32:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:32:57,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:32:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:32:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:32:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:32:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:32:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:32:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:32:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:32:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:32:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:32:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:32:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:32:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:32:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:32:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:32:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:32:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:32:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:32:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:32:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:32:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:32:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:32:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 04:32:57,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:32:57,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074758730] [2024-11-20 04:32:57,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074758730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:32:57,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:32:57,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:32:57,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055396042] [2024-11-20 04:32:57,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:32:57,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:32:57,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:32:57,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:32:57,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:32:57,622 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 04:32:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:32:57,679 INFO L93 Difference]: Finished difference Result 217 states and 325 transitions. [2024-11-20 04:32:57,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:32:57,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2024-11-20 04:32:57,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:32:57,681 INFO L225 Difference]: With dead ends: 217 [2024-11-20 04:32:57,681 INFO L226 Difference]: Without dead ends: 119 [2024-11-20 04:32:57,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:32:57,683 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 51 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:32:57,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 223 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:32:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-20 04:32:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2024-11-20 04:32:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 04:32:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-11-20 04:32:57,691 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 145 [2024-11-20 04:32:57,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:32:57,692 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-11-20 04:32:57,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 04:32:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-11-20 04:32:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 04:32:57,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:32:57,694 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:32:57,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:32:57,694 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:32:57,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:32:57,695 INFO L85 PathProgramCache]: Analyzing trace with hash 184355738, now seen corresponding path program 1 times [2024-11-20 04:32:57,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:32:57,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638770862] [2024-11-20 04:32:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:32:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:32:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:32:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:32:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:32:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:32:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:32:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:32:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:32:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:32:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:32:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:32:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:32:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 04:32:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 04:32:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 04:32:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 04:32:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:32:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:32:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 04:32:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:32:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 04:32:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:32:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-20 04:32:58,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:32:58,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638770862] [2024-11-20 04:32:58,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638770862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:32:58,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669220186] [2024-11-20 04:32:58,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:32:58,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:32:58,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:32:58,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:32:58,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 04:32:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:32:58,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 04:32:58,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:32:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 54 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-11-20 04:32:58,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:32:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-20 04:32:58,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669220186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:32:58,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:32:58,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-20 04:32:58,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493071211] [2024-11-20 04:32:58,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:32:58,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 04:32:58,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:32:58,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 04:32:58,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-20 04:32:58,971 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 5 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) [2024-11-20 04:32:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:32:59,190 INFO L93 Difference]: Finished difference Result 211 states and 307 transitions. [2024-11-20 04:32:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 04:32:59,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 5 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) Word has length 145 [2024-11-20 04:32:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:32:59,192 INFO L225 Difference]: With dead ends: 211 [2024-11-20 04:32:59,192 INFO L226 Difference]: Without dead ends: 113 [2024-11-20 04:32:59,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-20 04:32:59,193 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 57 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:32:59,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 193 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:32:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-20 04:32:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-20 04:32:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 84 states have internal predecessors, (112), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 04:32:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2024-11-20 04:32:59,203 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 145 [2024-11-20 04:32:59,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:32:59,203 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2024-11-20 04:32:59,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 5 states have call successors, (50), 3 states have call predecessors, (50), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) [2024-11-20 04:32:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2024-11-20 04:32:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 04:32:59,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:32:59,205 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:32:59,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 04:32:59,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:32:59,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:32:59,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:32:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash -991198518, now seen corresponding path program 1 times [2024-11-20 04:32:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:32:59,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987043801] [2024-11-20 04:32:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:32:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:32:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 04:32:59,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766729786] [2024-11-20 04:32:59,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:32:59,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:32:59,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:32:59,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:32:59,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 04:32:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:32:59,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:32:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:32:59,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:32:59,725 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:32:59,726 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:32:59,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 04:32:59,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:32:59,935 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 04:33:00,027 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:33:00,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:33:00 BoogieIcfgContainer [2024-11-20 04:33:00,030 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:33:00,030 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:33:00,030 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:33:00,030 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:33:00,031 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:32:56" (3/4) ... [2024-11-20 04:33:00,033 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:33:00,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:33:00,035 INFO L158 Benchmark]: Toolchain (without parser) took 4734.63ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 87.3MB in the beginning and 75.9MB in the end (delta: 11.4MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. [2024-11-20 04:33:00,035 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:33:00,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.46ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 70.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 04:33:00,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.00ms. Allocated memory is still 159.4MB. Free memory was 70.0MB in the beginning and 64.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 04:33:00,035 INFO L158 Benchmark]: Boogie Preprocessor took 62.27ms. Allocated memory is still 159.4MB. Free memory was 64.8MB in the beginning and 58.0MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 04:33:00,036 INFO L158 Benchmark]: RCFGBuilder took 613.27ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 58.0MB in the beginning and 172.7MB in the end (delta: -114.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-20 04:33:00,036 INFO L158 Benchmark]: TraceAbstraction took 3658.86ms. Allocated memory is still 230.7MB. Free memory was 171.6MB in the beginning and 75.9MB in the end (delta: 95.7MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2024-11-20 04:33:00,036 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 230.7MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:33:00,037 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.16ms. Allocated memory is still 159.4MB. Free memory is still 111.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.46ms. Allocated memory is still 159.4MB. Free memory was 87.1MB in the beginning and 70.0MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.00ms. Allocated memory is still 159.4MB. Free memory was 70.0MB in the beginning and 64.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.27ms. Allocated memory is still 159.4MB. Free memory was 64.8MB in the beginning and 58.0MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 613.27ms. Allocated memory was 159.4MB in the beginning and 230.7MB in the end (delta: 71.3MB). Free memory was 58.0MB in the beginning and 172.7MB in the end (delta: -114.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3658.86ms. Allocated memory is still 230.7MB. Free memory was 171.6MB in the beginning and 75.9MB in the end (delta: 95.7MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 230.7MB. Free memory is still 75.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryArithmeticFLOAToperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 128; [L25] unsigned char var_1_4 = 2; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 32; [L28] unsigned short int var_1_8 = 100; [L29] float var_1_9 = 255.75; [L30] signed char var_1_10 = 64; [L31] signed char var_1_11 = 32; [L32] signed char var_1_12 = 4; [L33] float var_1_13 = 0.0; [L34] float var_1_14 = 7.25; [L35] float var_1_15 = 8.125; [L36] float var_1_16 = 24.5; [L37] signed short int var_1_17 = -256; [L38] double var_1_18 = 31.5; [L39] float var_1_19 = 255.2; [L40] signed long int var_1_21 = -8; [L41] double var_1_22 = 0.5; [L42] unsigned short int var_1_23 = 200; [L43] double var_1_26 = 1.8; [L44] unsigned short int var_1_29 = 8; [L45] unsigned char var_1_37 = 1; [L46] unsigned char var_1_39 = 0; [L47] unsigned char var_1_40 = 0; [L48] unsigned long int var_1_41 = 10; [L49] unsigned char last_1_var_1_6 = 32; [L50] unsigned short int last_1_var_1_8 = 100; VAL [isInitial=0, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L164] last_1_var_1_6 = var_1_6 [L165] last_1_var_1_8 = var_1_8 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L175] RET updateLastVariables() [L176] CALL updateVariables() [L129] var_1_2 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L130] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L131] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L131] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=128, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L132] var_1_3 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_3 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L133] RET assume_abort_if_not(var_1_3 >= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L134] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L134] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=2, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L135] var_1_4 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L136] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L137] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L137] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=2, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L138] var_1_5 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L139] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L140] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L140] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=64, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L141] var_1_10 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_10 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L142] RET assume_abort_if_not(var_1_10 >= 63) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L143] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L143] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=32, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L144] var_1_11 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L145] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L146] CALL assume_abort_if_not(var_1_11 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L146] RET assume_abort_if_not(var_1_11 <= 64) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=4, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L147] var_1_12 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L148] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L149] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L149] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L151] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_14=29/4, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L152] var_1_14 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L153] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_16=49/2, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L154] var_1_16 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L155] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L156] var_1_39 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L157] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L158] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L158] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L159] var_1_40 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L160] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L161] CALL assume_abort_if_not(var_1_40 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L161] RET assume_abort_if_not(var_1_40 <= 0) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L176] RET updateVariables() [L177] CALL step() [L54] signed long int stepLocal_0 = 64 + (var_1_5 / var_1_3); VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, stepLocal_0=64, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=32, var_1_8=100, var_1_9=1023/4] [L55] COND TRUE stepLocal_0 != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6)) [L56] var_1_6 = var_1_4 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=1276/5, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100, var_1_9=1023/4] [L60] var_1_19 = var_1_13 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=5, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100, var_1_9=1023/4] [L61] COND FALSE !(\read(var_1_2)) [L64] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=1, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100, var_1_9=1023/4] [L66] COND TRUE var_1_2 || (var_1_5 <= (var_1_3 / var_1_3)) [L67] var_1_37 = (var_1_39 || var_1_40) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100, var_1_9=1023/4] [L69] COND FALSE !((var_1_4 + ((((var_1_4) < (var_1_10)) ? (var_1_4) : (var_1_10)))) <= var_1_11) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100, var_1_9=1023/4] [L74] COND TRUE ((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5 [L75] var_1_9 = (64.8f - (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=8, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L79] COND FALSE !(var_1_2 || (var_1_16 <= var_1_13)) [L86] var_1_29 = (var_1_3 + (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) + var_1_5)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_15=65/8, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L88] var_1_15 = (var_1_14 + var_1_16) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L89] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_17=-256, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L92] COND TRUE var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13)))) [L93] var_1_17 = var_1_4 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_17=63, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L98] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_17=63, var_1_18=63/2, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L105] COND FALSE !((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) [L110] var_1_18 = var_1_16 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-8, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L112] var_1_21 = -16 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L113] COND FALSE !(var_1_11 > var_1_3) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=1/2, var_1_23=200, var_1_26=9/5, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L116] COND TRUE (var_1_2 || var_1_2) || ((- var_1_16) <= var_1_14) [L117] var_1_26 = ((((9.99999999739E8) < (var_1_16)) ? (9.99999999739E8) : (var_1_16))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=1/2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L120] signed long int stepLocal_1 = var_1_3 - var_1_5; VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, stepLocal_1=126, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=1/2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=100] [L121] COND TRUE (var_1_17 + var_1_6) >= stepLocal_1 [L122] var_1_8 = ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=1/2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=127] [L126] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=127] [L177] RET step() [L178] CALL, EXPR property() [L168] EXPR ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_17 + var_1_6) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_6)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=127] [L168-L169] return ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 - var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 + var_1_5)))) && (((64 + (var_1_5 / var_1_3)) != (last_1_var_1_8 - (var_1_4 + last_1_var_1_6))) ? (var_1_6 == ((unsigned char) var_1_4)) : (var_1_6 == ((unsigned char) 128)))) && (((var_1_17 + var_1_6) >= (var_1_3 - var_1_5)) ? (var_1_8 == ((unsigned short int) ((((var_1_6) > (var_1_3)) ? (var_1_6) : (var_1_3))))) : (var_1_8 == ((unsigned short int) var_1_6)))) && ((((var_1_10 - var_1_11) - (16 + var_1_12)) != var_1_5) ? (var_1_9 == ((float) (64.8f - (var_1_13 - var_1_14)))) : (var_1_9 == ((float) var_1_13)))) && (var_1_15 == ((float) (var_1_14 + var_1_16)))) && (var_1_2 ? (var_1_17 == ((signed short int) (var_1_3 + var_1_12))) : ((var_1_14 == (((((99.8f) < (var_1_16)) ? (99.8f) : (var_1_16))) / ((((255.6f) > (var_1_13)) ? (255.6f) : (var_1_13))))) ? (var_1_17 == ((signed short int) var_1_4)) : (var_1_17 == ((signed short int) (var_1_5 - var_1_3)))))) && (((var_1_2 || (var_1_16 > var_1_13)) && (var_1_3 < var_1_1)) ? (((var_1_11 << var_1_12) > var_1_5) ? (var_1_18 == ((double) var_1_13)) : 1) : (var_1_18 == ((double) var_1_16))) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=32, last_1_var_1_8=100, var_1_10=63, var_1_11=45, var_1_12=0, var_1_13=2, var_1_16=3, var_1_17=63, var_1_18=3, var_1_19=2, var_1_1=64, var_1_21=-16, var_1_22=2, var_1_23=200, var_1_26=999999999739/1000, var_1_29=191, var_1_2=0, var_1_37=0, var_1_39=0, var_1_3=-129, var_1_40=0, var_1_41=10, var_1_4=-1473, var_1_5=513, var_1_6=-1473, var_1_8=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 760 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 314 IncrementalHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 439 mSDtfsCounter, 314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 479 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 40 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1015 NumberOfCodeBlocks, 1015 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 862 ConstructedInterpolants, 0 QuantifiedInterpolants, 2252 SizeOfPredicates, 2 NumberOfNonLiveVariables, 351 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4878/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 04:33:00,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f8764d0703f262f882fea925b2e1c51288e3d3f7182d2157f47a63a3f8cbf94f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:33:02,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:33:02,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:33:02,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:33:02,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:33:02,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:33:02,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:33:02,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:33:02,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:33:02,304 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:33:02,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:33:02,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:33:02,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:33:02,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:33:02,307 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:33:02,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:33:02,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:33:02,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:33:02,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:33:02,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:33:02,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:33:02,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:33:02,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:33:02,311 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:33:02,311 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:33:02,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:33:02,314 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:33:02,314 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:33:02,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:33:02,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:33:02,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:33:02,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:33:02,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:33:02,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:33:02,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:33:02,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:33:02,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:33:02,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:33:02,328 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:33:02,328 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:33:02,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:33:02,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:33:02,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:33:02,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:33:02,330 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f8764d0703f262f882fea925b2e1c51288e3d3f7182d2157f47a63a3f8cbf94f [2024-11-20 04:33:02,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:33:02,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:33:02,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:33:02,625 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:33:02,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:33:02,627 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-20.i [2024-11-20 04:33:04,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:33:04,191 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:33:04,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i [2024-11-20 04:33:04,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7f26df3/ce0d578e2ae64238872abb60587af999/FLAGa08631552 [2024-11-20 04:33:04,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7f26df3/ce0d578e2ae64238872abb60587af999 [2024-11-20 04:33:04,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:33:04,226 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:33:04,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:33:04,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:33:04,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:33:04,234 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3224a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04, skipping insertion in model container [2024-11-20 04:33:04,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:33:04,422 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i[919,932] [2024-11-20 04:33:04,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:33:04,540 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:33:04,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i[919,932] [2024-11-20 04:33:04,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:33:04,592 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:33:04,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04 WrapperNode [2024-11-20 04:33:04,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:33:04,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:33:04,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:33:04,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:33:04,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,631 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-11-20 04:33:04,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:33:04,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:33:04,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:33:04,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:33:04,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,664 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 04:33:04,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,689 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:33:04,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:33:04,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:33:04,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:33:04,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (1/1) ... [2024-11-20 04:33:04,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:33:04,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:33:04,752 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 04:33:04,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 04:33:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:33:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:33:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:33:04,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:33:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:33:04,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:33:04,852 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:33:04,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:33:11,911 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 04:33:11,911 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:33:11,921 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:33:11,921 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:33:11,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:33:11 BoogieIcfgContainer [2024-11-20 04:33:11,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:33:11,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:33:11,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:33:11,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:33:11,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:33:04" (1/3) ... [2024-11-20 04:33:11,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d190581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:33:11, skipping insertion in model container [2024-11-20 04:33:11,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:33:04" (2/3) ... [2024-11-20 04:33:11,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d190581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:33:11, skipping insertion in model container [2024-11-20 04:33:11,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:33:11" (3/3) ... [2024-11-20 04:33:11,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-20.i [2024-11-20 04:33:11,946 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:33:11,947 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:33:11,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:33:12,001 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;@24bfe21e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:33:12,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:33:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 04:33:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 04:33:12,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:33:12,022 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:33:12,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:33:12,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:33:12,027 INFO L85 PathProgramCache]: Analyzing trace with hash 598315384, now seen corresponding path program 1 times [2024-11-20 04:33:12,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:33:12,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020527863] [2024-11-20 04:33:12,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:33:12,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:33:12,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:33:12,044 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:33:12,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 04:33:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:33:12,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 04:33:12,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:33:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-20 04:33:12,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:33:12,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:33:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020527863] [2024-11-20 04:33:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020527863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:33:12,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:33:12,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:33:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620028877] [2024-11-20 04:33:12,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:33:12,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:33:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:33:12,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:33:12,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:33:12,551 INFO L87 Difference]: Start difference. First operand has 74 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 04:33:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:33:12,575 INFO L93 Difference]: Finished difference Result 141 states and 243 transitions. [2024-11-20 04:33:12,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:33:12,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 142 [2024-11-20 04:33:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:33:12,583 INFO L225 Difference]: With dead ends: 141 [2024-11-20 04:33:12,584 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 04:33:12,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:33:12,590 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:33:12,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:33:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 04:33:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-20 04:33:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 04:33:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-20 04:33:12,628 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 142 [2024-11-20 04:33:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:33:12,629 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-20 04:33:12,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-20 04:33:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-20 04:33:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 04:33:12,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:33:12,632 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:33:12,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 04:33:12,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:33:12,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:33:12,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:33:12,834 INFO L85 PathProgramCache]: Analyzing trace with hash 907781746, now seen corresponding path program 1 times [2024-11-20 04:33:12,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:33:12,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710902827] [2024-11-20 04:33:12,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:33:12,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:33:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:33:12,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:33:12,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 04:33:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:33:13,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 04:33:13,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:33:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 04:33:13,343 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:33:13,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:33:13,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710902827] [2024-11-20 04:33:13,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710902827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:33:13,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:33:13,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:33:13,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872019167] [2024-11-20 04:33:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:33:13,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:33:13,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:33:13,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:33:13,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:33:13,350 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 04:33:17,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:33:20,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:33:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:33:20,254 INFO L93 Difference]: Finished difference Result 162 states and 246 transitions. [2024-11-20 04:33:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:33:20,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-20 04:33:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:33:20,297 INFO L225 Difference]: With dead ends: 162 [2024-11-20 04:33:20,297 INFO L226 Difference]: Without dead ends: 95 [2024-11-20 04:33:20,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:33:20,299 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 33 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-20 04:33:20,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 186 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2024-11-20 04:33:20,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-20 04:33:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 79. [2024-11-20 04:33:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 04:33:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 119 transitions. [2024-11-20 04:33:20,309 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 119 transitions. Word has length 142 [2024-11-20 04:33:20,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:33:20,311 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 119 transitions. [2024-11-20 04:33:20,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 04:33:20,311 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 119 transitions. [2024-11-20 04:33:20,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 04:33:20,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:33:20,313 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:33:20,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 04:33:20,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:33:20,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:33:20,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:33:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash 302108317, now seen corresponding path program 1 times [2024-11-20 04:33:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:33:20,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52905085] [2024-11-20 04:33:20,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:33:20,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:33:20,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:33:20,531 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:33:20,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 04:33:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:33:20,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 04:33:20,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:33:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-20 04:33:21,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:33:21,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:33:21,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52905085] [2024-11-20 04:33:21,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52905085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:33:21,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:33:21,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:33:21,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407889301] [2024-11-20 04:33:21,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:33:21,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:33:21,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:33:21,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:33:21,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:33:21,134 INFO L87 Difference]: Start difference. First operand 79 states and 119 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 04:33:25,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:33:29,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:33:29,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:33:29,913 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2024-11-20 04:33:29,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:33:29,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-20 04:33:29,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:33:29,915 INFO L225 Difference]: With dead ends: 171 [2024-11-20 04:33:29,915 INFO L226 Difference]: Without dead ends: 95 [2024-11-20 04:33:29,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:33:29,916 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 29 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-20 04:33:29,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 201 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-20 04:33:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-20 04:33:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2024-11-20 04:33:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 04:33:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-11-20 04:33:29,931 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 143 [2024-11-20 04:33:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:33:29,933 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-11-20 04:33:29,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-20 04:33:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-11-20 04:33:29,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 04:33:29,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:33:29,935 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:33:29,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 04:33:30,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:33:30,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:33:30,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:33:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1386835425, now seen corresponding path program 1 times [2024-11-20 04:33:30,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:33:30,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737809304] [2024-11-20 04:33:30,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:33:30,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:33:30,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:33:30,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:33:30,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 04:33:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:33:30,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 04:33:30,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:33:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 497 proven. 102 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-20 04:33:33,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:33:35,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:33:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737809304] [2024-11-20 04:33:35,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737809304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:33:35,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1401354368] [2024-11-20 04:33:35,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:33:35,179 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 04:33:35,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 04:33:35,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 04:33:35,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-20 04:33:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:33:36,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 04:33:36,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:33:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-20 04:33:37,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:33:38,503 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-20 04:33:38,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1401354368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:33:38,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:33:38,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 13 [2024-11-20 04:33:38,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244120608] [2024-11-20 04:33:38,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:33:38,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 04:33:38,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:33:38,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 04:33:38,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2024-11-20 04:33:38,510 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 4 states have call successors, (49), 4 states have call predecessors, (49), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-11-20 04:33:42,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:33:46,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:33:49,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:33:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:33:49,801 INFO L93 Difference]: Finished difference Result 181 states and 254 transitions. [2024-11-20 04:33:49,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 04:33:49,835 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 4 states have call successors, (49), 4 states have call predecessors, (49), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) Word has length 143 [2024-11-20 04:33:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:33:49,837 INFO L225 Difference]: With dead ends: 181 [2024-11-20 04:33:49,837 INFO L226 Difference]: Without dead ends: 100 [2024-11-20 04:33:49,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 488 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2024-11-20 04:33:49,838 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 40 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:33:49,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 195 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 263 Invalid, 1 Unknown, 0 Unchecked, 11.0s Time] [2024-11-20 04:33:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-20 04:33:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-11-20 04:33:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 04:33:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2024-11-20 04:33:49,857 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 143 [2024-11-20 04:33:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:33:49,857 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2024-11-20 04:33:49,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 12 states have internal predecessors, (80), 4 states have call successors, (49), 4 states have call predecessors, (49), 7 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2024-11-20 04:33:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2024-11-20 04:33:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 04:33:49,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:33:49,864 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:33:49,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 04:33:50,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-20 04:33:50,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 04:33:50,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:33:50,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:33:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1331757272, now seen corresponding path program 1 times [2024-11-20 04:33:50,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:33:50,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349996070] [2024-11-20 04:33:50,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:33:50,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:33:50,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:33:50,275 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:33:50,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 04:33:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:33:50,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 04:33:50,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:33:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 166 proven. 272 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-20 04:33:57,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:33:58,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:33:58,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349996070] [2024-11-20 04:33:58,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349996070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:33:58,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [720530745] [2024-11-20 04:33:58,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:33:58,868 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 04:33:58,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 04:33:58,871 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 04:33:58,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-20 04:33:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:34:00,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 04:34:00,009 INFO L278 TraceCheckSpWp]: Computing forward predicates...