./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.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 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:18:15,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:18:15,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:18:15,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:18:15,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:18:15,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:18:15,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:18:15,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:18:15,569 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:18:15,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:18:15,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:18:15,570 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:18:15,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:18:15,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:18:15,572 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:18:15,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:18:15,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:18:15,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:18:15,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:18:15,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:18:15,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:18:15,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:18:15,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:18:15,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:18:15,578 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:18:15,579 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:18:15,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:18:15,579 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:18:15,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:18:15,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:18:15,580 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:18:15,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:18:15,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:18:15,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:18:15,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:18:15,583 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:18:15,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:18:15,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:18:15,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:18:15,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:18:15,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:18:15,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:18:15,586 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 -> 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 [2024-11-08 22:18:15,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:18:15,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:18:15,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:18:15,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:18:15,857 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:18:15,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-11-08 22:18:17,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:18:17,525 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:18:17,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-11-08 22:18:17,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d44fe176/30c6535e1b09410286ed4e564150987e/FLAGc24e8dfb4 [2024-11-08 22:18:17,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d44fe176/30c6535e1b09410286ed4e564150987e [2024-11-08 22:18:17,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:18:17,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:18:17,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:18:17,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:18:17,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:18:17,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:17,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4acbe02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17, skipping insertion in model container [2024-11-08 22:18:17,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:17,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:18:17,792 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-ps-ci_file-65.i[919,932] [2024-11-08 22:18:17,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:18:17,901 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:18:17,913 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-ps-ci_file-65.i[919,932] [2024-11-08 22:18:17,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:18:17,980 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:18:17,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17 WrapperNode [2024-11-08 22:18:17,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:18:17,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:18:17,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:18:17,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:18:17,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,075 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2024-11-08 22:18:18,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:18:18,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:18:18,076 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:18:18,076 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:18:18,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,138 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:18:18,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:18:18,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:18:18,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:18:18,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:18:18,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (1/1) ... [2024-11-08 22:18:18,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:18:18,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:18:18,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:18:18,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:18:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:18:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:18:18,265 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:18:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:18:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:18:18,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:18:18,359 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:18:18,361 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:18:18,783 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 22:18:18,783 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:18:18,805 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:18:18,807 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:18:18,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:18:18 BoogieIcfgContainer [2024-11-08 22:18:18,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:18:18,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:18:18,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:18:18,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:18:18,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:18:17" (1/3) ... [2024-11-08 22:18:18,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14aa58c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:18:18, skipping insertion in model container [2024-11-08 22:18:18,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:17" (2/3) ... [2024-11-08 22:18:18,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14aa58c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:18:18, skipping insertion in model container [2024-11-08 22:18:18,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:18:18" (3/3) ... [2024-11-08 22:18:18,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-11-08 22:18:18,836 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:18:18,836 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:18:18,909 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:18:18,916 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;@1a843435, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:18:18,916 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:18:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 79 states have internal predecessors, (119), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:18:18,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 22:18:18,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:18,941 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:18,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:18,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:18,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1493030043, now seen corresponding path program 1 times [2024-11-08 22:18:18,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:18,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840415847] [2024-11-08 22:18:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:18,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:18:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:18:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:18:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:18:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:18:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:18:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:18:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:18:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:18:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:18:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:18:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:18:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:18:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:18:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:18:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:18:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:18:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:18:19,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:19,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840415847] [2024-11-08 22:18:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840415847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:19,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:19,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:18:19,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945474925] [2024-11-08 22:18:19,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:19,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:18:19,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:18:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:18:19,530 INFO L87 Difference]: Start difference. First operand has 103 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 79 states have internal predecessors, (119), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:18:19,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:19,589 INFO L93 Difference]: Finished difference Result 197 states and 340 transitions. [2024-11-08 22:18:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:18:19,593 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 152 [2024-11-08 22:18:19,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:19,600 INFO L225 Difference]: With dead ends: 197 [2024-11-08 22:18:19,600 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 22:18:19,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:18:19,607 INFO L432 NwaCegarLoop]: 150 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, 150 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:19,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:18:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 22:18:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-08 22:18:19,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:18:19,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2024-11-08 22:18:19,649 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 152 [2024-11-08 22:18:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:19,649 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2024-11-08 22:18:19,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:18:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2024-11-08 22:18:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 22:18:19,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:19,654 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:19,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:18:19,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:19,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1183979105, now seen corresponding path program 1 times [2024-11-08 22:18:19,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:19,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940643364] [2024-11-08 22:18:19,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:19,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:18:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:18:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:18:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:18:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:18:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:18:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:18:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:18:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:18:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:18:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:18:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:18:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:18:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:18:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:18:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:18:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:18:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:19,963 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:18:19,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:19,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940643364] [2024-11-08 22:18:19,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940643364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:19,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:19,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:18:19,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454826778] [2024-11-08 22:18:19,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:19,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:18:19,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:19,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:18:19,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:18:19,969 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:18:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:20,079 INFO L93 Difference]: Finished difference Result 285 states and 444 transitions. [2024-11-08 22:18:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:18:20,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-11-08 22:18:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:20,083 INFO L225 Difference]: With dead ends: 285 [2024-11-08 22:18:20,083 INFO L226 Difference]: Without dead ends: 191 [2024-11-08 22:18:20,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:18:20,085 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 134 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:20,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 399 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:18:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-08 22:18:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 114. [2024-11-08 22:18:20,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:18:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 174 transitions. [2024-11-08 22:18:20,115 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 174 transitions. Word has length 152 [2024-11-08 22:18:20,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:20,117 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 174 transitions. [2024-11-08 22:18:20,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:18:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 174 transitions. [2024-11-08 22:18:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 22:18:20,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:20,121 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:20,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:18:20,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:20,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash -528873689, now seen corresponding path program 1 times [2024-11-08 22:18:20,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:20,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513706242] [2024-11-08 22:18:20,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:18:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:18:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:18:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:18:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:18:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:18:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:18:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:18:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:18:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:18:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:18:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:18:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:18:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:18:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:18:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:18:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:18:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:18:20,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:20,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513706242] [2024-11-08 22:18:20,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513706242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:20,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:20,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:18:20,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780270811] [2024-11-08 22:18:20,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:20,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:18:20,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:20,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:18:20,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:18:20,393 INFO L87 Difference]: Start difference. First operand 114 states and 174 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:18:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:20,421 INFO L93 Difference]: Finished difference Result 206 states and 313 transitions. [2024-11-08 22:18:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:18:20,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2024-11-08 22:18:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:20,424 INFO L225 Difference]: With dead ends: 206 [2024-11-08 22:18:20,424 INFO L226 Difference]: Without dead ends: 95 [2024-11-08 22:18:20,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:18:20,426 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:20,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:18:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-08 22:18:20,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-08 22:18:20,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 71 states have internal predecessors, (97), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:18:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2024-11-08 22:18:20,439 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 153 [2024-11-08 22:18:20,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:20,440 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2024-11-08 22:18:20,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:18:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2024-11-08 22:18:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-08 22:18:20,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:20,448 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:20,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:18:20,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash 454918950, now seen corresponding path program 1 times [2024-11-08 22:18:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:20,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203525030] [2024-11-08 22:18:20,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:18:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:18:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:18:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:18:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:18:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:18:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:18:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:18:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:18:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:18:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:18:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:18:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:18:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:18:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:18:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:18:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:18:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:18:21,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:21,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203525030] [2024-11-08 22:18:21,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203525030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:21,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:21,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 22:18:21,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703906184] [2024-11-08 22:18:21,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:21,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 22:18:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:21,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 22:18:21,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:18:21,560 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:18:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:22,064 INFO L93 Difference]: Finished difference Result 266 states and 406 transitions. [2024-11-08 22:18:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 22:18:22,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-11-08 22:18:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:22,067 INFO L225 Difference]: With dead ends: 266 [2024-11-08 22:18:22,067 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 22:18:22,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:18:22,069 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 176 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:22,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 647 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 22:18:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 22:18:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 95. [2024-11-08 22:18:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:18:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2024-11-08 22:18:22,090 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 154 [2024-11-08 22:18:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:22,093 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2024-11-08 22:18:22,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:18:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2024-11-08 22:18:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 22:18:22,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:22,098 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:22,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:18:22,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:22,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash -211074340, now seen corresponding path program 1 times [2024-11-08 22:18:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:22,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327804555] [2024-11-08 22:18:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:22,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:18:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:18:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:18:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:18:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:18:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:18:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:18:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:18:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:18:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:18:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:18:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:18:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:18:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:18:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:18:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:18:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:18:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-08 22:18:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:22,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327804555] [2024-11-08 22:18:22,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327804555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:18:22,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889702036] [2024-11-08 22:18:22,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:22,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:18:22,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:18:22,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 22:18:22,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 22:18:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:22,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 22:18:22,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:18:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 45 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-08 22:18:23,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:18:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-08 22:18:23,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889702036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:18:23,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:18:23,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2024-11-08 22:18:23,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957295933] [2024-11-08 22:18:23,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:18:23,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 22:18:23,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:23,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 22:18:23,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-08 22:18:23,679 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 5 states have call successors, (59), 3 states have call predecessors, (59), 6 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-11-08 22:18:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:24,303 INFO L93 Difference]: Finished difference Result 268 states and 394 transitions. [2024-11-08 22:18:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 22:18:24,304 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 5 states have call successors, (59), 3 states have call predecessors, (59), 6 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) Word has length 158 [2024-11-08 22:18:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:24,308 INFO L225 Difference]: With dead ends: 268 [2024-11-08 22:18:24,308 INFO L226 Difference]: Without dead ends: 176 [2024-11-08 22:18:24,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-08 22:18:24,311 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 468 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:24,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 534 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 22:18:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-08 22:18:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 154. [2024-11-08 22:18:24,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.276190476190476) internal successors, (134), 105 states have internal predecessors, (134), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 22:18:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 222 transitions. [2024-11-08 22:18:24,345 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 222 transitions. Word has length 158 [2024-11-08 22:18:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:24,346 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 222 transitions. [2024-11-08 22:18:24,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 15 states have internal predecessors, (98), 5 states have call successors, (59), 3 states have call predecessors, (59), 6 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-11-08 22:18:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 222 transitions. [2024-11-08 22:18:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 22:18:24,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:24,348 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:24,366 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-08 22:18:24,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:18:24,550 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:24,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:24,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1776124653, now seen corresponding path program 1 times [2024-11-08 22:18:24,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:24,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551632116] [2024-11-08 22:18:24,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:24,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:18:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:18:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:18:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:18:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:18:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:18:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:18:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:18:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:18:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:18:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:18:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 22:18:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 22:18:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 22:18:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 22:18:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:18:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:18:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 22:18:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 22:18:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 22:18:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 22:18:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 22:18:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:18:25,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:18:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551632116] [2024-11-08 22:18:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551632116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:25,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:25,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 22:18:25,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341791879] [2024-11-08 22:18:25,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:25,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 22:18:25,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:18:25,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 22:18:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 22:18:25,483 INFO L87 Difference]: Start difference. First operand 154 states and 222 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-08 22:18:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:26,029 INFO L93 Difference]: Finished difference Result 357 states and 496 transitions. [2024-11-08 22:18:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 22:18:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 159 [2024-11-08 22:18:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:26,032 INFO L225 Difference]: With dead ends: 357 [2024-11-08 22:18:26,032 INFO L226 Difference]: Without dead ends: 261 [2024-11-08 22:18:26,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-08 22:18:26,033 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 498 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:26,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 440 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 22:18:26,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-08 22:18:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2024-11-08 22:18:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 190 states have (on average 1.2789473684210526) internal successors, (243), 191 states have internal predecessors, (243), 56 states have call successors, (56), 11 states have call predecessors, (56), 11 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 22:18:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 355 transitions. [2024-11-08 22:18:26,064 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 355 transitions. Word has length 159 [2024-11-08 22:18:26,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:26,065 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 355 transitions. [2024-11-08 22:18:26,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-08 22:18:26,065 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 355 transitions. [2024-11-08 22:18:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 22:18:26,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:26,067 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:26,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:18:26,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:26,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1189318639, now seen corresponding path program 1 times [2024-11-08 22:18:26,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:18:26,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286774582] [2024-11-08 22:18:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:26,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:18:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:18:26,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:18:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:18:26,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:18:26,245 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:18:26,246 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:18:26,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:18:26,252 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:26,389 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:18:26,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:18:26 BoogieIcfgContainer [2024-11-08 22:18:26,393 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:18:26,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:18:26,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:18:26,394 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:18:26,395 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:18:18" (3/4) ... [2024-11-08 22:18:26,397 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:18:26,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:18:26,400 INFO L158 Benchmark]: Toolchain (without parser) took 8850.66ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 108.9MB in the beginning and 197.1MB in the end (delta: -88.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:18:26,400 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 76.5MB in the beginning and 76.4MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:18:26,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.97ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 91.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 22:18:26,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.41ms. Allocated memory is still 176.2MB. Free memory was 91.9MB in the beginning and 146.3MB in the end (delta: -54.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-08 22:18:26,402 INFO L158 Benchmark]: Boogie Preprocessor took 105.64ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 141.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:18:26,402 INFO L158 Benchmark]: RCFGBuilder took 625.33ms. Allocated memory is still 176.2MB. Free memory was 141.4MB in the beginning and 113.5MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 22:18:26,402 INFO L158 Benchmark]: TraceAbstraction took 7583.58ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 112.8MB in the beginning and 197.1MB in the end (delta: -84.3MB). Peak memory consumption was 118.7MB. Max. memory is 16.1GB. [2024-11-08 22:18:26,402 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 255.9MB. Free memory is still 197.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:18:26,403 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 76.5MB in the beginning and 76.4MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.97ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 91.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.41ms. Allocated memory is still 176.2MB. Free memory was 91.9MB in the beginning and 146.3MB in the end (delta: -54.4MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.64ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 141.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 625.33ms. Allocated memory is still 176.2MB. Free memory was 141.4MB in the beginning and 113.5MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7583.58ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 112.8MB in the beginning and 197.1MB in the end (delta: -84.3MB). Peak memory consumption was 118.7MB. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 255.9MB. Free memory is still 197.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryArithmeticDOUBLEoperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed long int var_1_29 = 50; [L41] signed char var_1_31 = 4; [L42] unsigned short int var_1_33 = 16; [L43] unsigned char var_1_39 = 4; [L44] signed long int var_1_41 = -5; [L45] double var_1_42 = 49.6; [L46] signed long int var_1_45 = -2; [L47] unsigned long int var_1_47 = 16; [L48] unsigned long int var_1_50 = 1275815169; [L49] unsigned long int var_1_51 = 1483937619; [L50] signed short int last_1_var_1_1 = 4; [L51] unsigned char last_1_var_1_14 = 1; [L52] signed char last_1_var_1_16 = 50; [L53] signed long int last_1_var_1_23 = -16; [L54] unsigned char last_1_var_1_24 = 1; [L55] double last_1_var_1_28 = 5.5; VAL [isInitial=0, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L177] last_1_var_1_1 = var_1_1 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_16 = var_1_16 [L180] last_1_var_1_23 = var_1_23 [L181] last_1_var_1_24 = var_1_24 [L182] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L141] var_1_11 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L143] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L143] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L144] var_1_12 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L145] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L146] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L146] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L147] var_1_13 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L149] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L150] var_1_15 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L151] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L152] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L153] var_1_19 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L154] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L155] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L156] var_1_21 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L157] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L158] var_1_22 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L159] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L160] var_1_25 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L161] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L162] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L163] var_1_26 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L164] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L165] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L167] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L168] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=1275815169, var_1_51=1483937619, var_1_8=64] [L169] var_1_50 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_50 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L170] RET assume_abort_if_not(var_1_50 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L171] CALL assume_abort_if_not(var_1_50 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L171] RET assume_abort_if_not(var_1_50 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=1483937619, var_1_8=64] [L172] var_1_51 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_51 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L173] RET assume_abort_if_not(var_1_51 >= 1073741824) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L174] CALL assume_abort_if_not(var_1_51 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L174] RET assume_abort_if_not(var_1_51 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=50, var_1_31=4, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L193] RET updateVariables() [L194] CALL step() [L59] var_1_29 = var_1_25 [L60] var_1_31 = var_1_19 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L61] COND TRUE \read(var_1_24) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=16, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L62] COND TRUE var_1_25 < var_1_19 [L63] var_1_33 = ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=4, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L70] var_1_39 = var_1_26 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L71] COND FALSE !(var_1_12 != var_1_1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L76] COND FALSE !(1000000.4f != var_1_21) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=-2, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L81] COND TRUE var_1_24 && var_1_14 [L82] var_1_45 = (((((var_1_16 + var_1_26)) > (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))))) ? ((var_1_16 + var_1_26)) : (((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L86] COND FALSE !(var_1_22 < var_1_22) [L99] var_1_47 = var_1_1 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L101] signed long int stepLocal_3 = last_1_var_1_23; [L102] unsigned char stepLocal_2 = ! (last_1_var_1_14 || last_1_var_1_14); VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, stepLocal_3=-16, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L103] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L114] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L116] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L116] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L117] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_20=500000004/5, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=11/2, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L121] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L122] var_1_28 = var_1_21 [L123] unsigned char stepLocal_0 = var_1_23 > 4; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=4, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L124] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L125] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=1, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L129] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L130] signed char stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L131] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_1=100, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L131] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L132] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L134] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L135] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, stepLocal_2=0, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L185] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L185] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L185] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L185-L186] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=0, var_1_12=4, var_1_13=3, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=126, var_1_1=300, var_1_21=2147483652, var_1_23=1, var_1_24=0, var_1_25=-1, var_1_26=1, var_1_27=0, var_1_28=2147483652, var_1_29=-1, var_1_31=126, var_1_33=0, var_1_39=1, var_1_41=-5, var_1_42=248/5, var_1_45=51, var_1_47=4, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1297 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1276 mSDsluCounter, 2442 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1395 mSDsCounter, 377 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 912 IncrementalHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 377 mSolverCounterUnsat, 1047 mSDtfsCounter, 912 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 659 GetRequests, 612 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=6, InterpolantAutomatonStates: 41, 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, 6 MinimizatonAttempts, 181 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1245 NumberOfCodeBlocks, 1245 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1236 ConstructedInterpolants, 0 QuantifiedInterpolants, 3500 SizeOfPredicates, 3 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 7257/7392 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 22:18:26,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.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 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:18:28,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:18:28,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:18:28,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:18:28,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:18:28,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:18:28,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:18:28,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:18:28,808 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:18:28,808 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:18:28,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:18:28,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:18:28,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:18:28,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:18:28,811 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:18:28,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:18:28,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:18:28,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:18:28,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:18:28,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:18:28,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:18:28,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:18:28,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:18:28,817 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:18:28,817 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:18:28,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:18:28,818 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:18:28,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:18:28,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:18:28,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:18:28,818 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:18:28,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:18:28,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:18:28,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:18:28,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:18:28,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:18:28,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:18:28,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:18:28,820 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:18:28,821 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:18:28,822 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:18:28,822 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:18:28,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:18:28,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:18:28,823 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 -> 71dfa0a4f236a73c35e5b369ba2d37d804ed373517c3a49a735fadde99b30392 [2024-11-08 22:18:29,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:18:29,143 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:18:29,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:18:29,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:18:29,148 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:18:29,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-11-08 22:18:30,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:18:30,909 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:18:30,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-11-08 22:18:30,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094c4b691/6712254fd16847afa08d485a06e6bc61/FLAG3c05353f2 [2024-11-08 22:18:30,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094c4b691/6712254fd16847afa08d485a06e6bc61 [2024-11-08 22:18:30,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:18:30,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:18:30,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:18:30,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:18:30,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:18:30,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:18:30" (1/1) ... [2024-11-08 22:18:30,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7268499c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:30, skipping insertion in model container [2024-11-08 22:18:30,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:18:30" (1/1) ... [2024-11-08 22:18:30,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:18:31,177 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-ps-ci_file-65.i[919,932] [2024-11-08 22:18:31,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:18:31,287 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:18:31,299 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-ps-ci_file-65.i[919,932] [2024-11-08 22:18:31,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:18:31,369 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:18:31,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31 WrapperNode [2024-11-08 22:18:31,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:18:31,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:18:31,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:18:31,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:18:31,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,447 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-08 22:18:31,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:18:31,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:18:31,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:18:31,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:18:31,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,489 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:18:31,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:18:31,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:18:31,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:18:31,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:18:31,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (1/1) ... [2024-11-08 22:18:31,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:18:31,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:18:31,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:18:31,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:18:31,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:18:31,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:18:31,613 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:18:31,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:18:31,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:18:31,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:18:31,695 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:18:31,698 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:18:33,309 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 22:18:33,310 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:18:33,326 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:18:33,327 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:18:33,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:18:33 BoogieIcfgContainer [2024-11-08 22:18:33,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:18:33,330 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:18:33,331 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:18:33,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:18:33,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:18:30" (1/3) ... [2024-11-08 22:18:33,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5962d0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:18:33, skipping insertion in model container [2024-11-08 22:18:33,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:18:31" (2/3) ... [2024-11-08 22:18:33,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5962d0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:18:33, skipping insertion in model container [2024-11-08 22:18:33,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:18:33" (3/3) ... [2024-11-08 22:18:33,347 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-65.i [2024-11-08 22:18:33,362 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:18:33,362 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:18:33,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:18:33,446 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;@67994d7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:18:33,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:18:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:18:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 22:18:33,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:33,467 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:33,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:33,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash 994043206, now seen corresponding path program 1 times [2024-11-08 22:18:33,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:18:33,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539432581] [2024-11-08 22:18:33,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:33,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:18:33,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:18:33,488 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:18:33,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 22:18:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:33,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:18:33,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:18:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-08 22:18:33,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:18:33,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:18:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539432581] [2024-11-08 22:18:33,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539432581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:33,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:33,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:18:33,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111134561] [2024-11-08 22:18:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:33,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:18:33,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:18:33,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:18:33,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:18:33,918 INFO L87 Difference]: Start difference. First operand has 77 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:18:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:33,958 INFO L93 Difference]: Finished difference Result 144 states and 252 transitions. [2024-11-08 22:18:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:18:33,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2024-11-08 22:18:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:33,969 INFO L225 Difference]: With dead ends: 144 [2024-11-08 22:18:33,969 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 22:18:33,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:18:33,979 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-08 22:18:33,980 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-08 22:18:33,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 22:18:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-08 22:18:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 46 states have internal predecessors, (62), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:18:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-08 22:18:34,036 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 146 [2024-11-08 22:18:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:34,039 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-08 22:18:34,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:18:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-08 22:18:34,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 22:18:34,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:34,044 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:34,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 22:18:34,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:18:34,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:34,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash 334150978, now seen corresponding path program 1 times [2024-11-08 22:18:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:18:34,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086872006] [2024-11-08 22:18:34,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:34,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:18:34,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:18:34,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:18:34,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 22:18:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:34,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:18:34,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:18:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:18:35,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:18:35,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:18:35,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086872006] [2024-11-08 22:18:35,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086872006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:35,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:35,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:18:35,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542170755] [2024-11-08 22:18:35,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:35,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:18:35,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:18:35,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:18:35,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:18:35,607 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:18:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:36,152 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2024-11-08 22:18:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:18:36,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-08 22:18:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:36,156 INFO L225 Difference]: With dead ends: 194 [2024-11-08 22:18:36,156 INFO L226 Difference]: Without dead ends: 127 [2024-11-08 22:18:36,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:18:36,158 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 20 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:36,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 194 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:18:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-08 22:18:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2024-11-08 22:18:36,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 22:18:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 180 transitions. [2024-11-08 22:18:36,192 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 180 transitions. Word has length 146 [2024-11-08 22:18:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:36,193 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 180 transitions. [2024-11-08 22:18:36,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:18:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 180 transitions. [2024-11-08 22:18:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 22:18:36,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:36,196 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:36,207 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-08 22:18:36,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:18:36,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:36,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1345268228, now seen corresponding path program 1 times [2024-11-08 22:18:36,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:18:36,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430878435] [2024-11-08 22:18:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:36,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:18:36,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:18:36,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:18:36,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 22:18:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:36,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 22:18:36,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:18:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:18:38,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:18:38,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:18:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430878435] [2024-11-08 22:18:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430878435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:18:38,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:18:38,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:18:38,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969502095] [2024-11-08 22:18:38,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:18:38,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:18:38,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:18:38,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:18:38,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:18:38,180 INFO L87 Difference]: Start difference. First operand 118 states and 180 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:18:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:39,905 INFO L93 Difference]: Finished difference Result 204 states and 309 transitions. [2024-11-08 22:18:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:18:39,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-08 22:18:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:39,920 INFO L225 Difference]: With dead ends: 204 [2024-11-08 22:18:39,921 INFO L226 Difference]: Without dead ends: 137 [2024-11-08 22:18:39,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:18:39,922 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 64 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:39,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 278 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 22:18:39,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-08 22:18:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2024-11-08 22:18:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 22:18:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 189 transitions. [2024-11-08 22:18:39,947 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 189 transitions. Word has length 146 [2024-11-08 22:18:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:39,947 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 189 transitions. [2024-11-08 22:18:39,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:18:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 189 transitions. [2024-11-08 22:18:39,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 22:18:39,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:39,950 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:39,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 22:18:40,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:18:40,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:40,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:40,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1738295238, now seen corresponding path program 1 times [2024-11-08 22:18:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:18:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629711264] [2024-11-08 22:18:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:40,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:18:40,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:18:40,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:18:40,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 22:18:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:40,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 22:18:40,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:18:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 393 proven. 45 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2024-11-08 22:18:40,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:18:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-08 22:18:41,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:18:41,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629711264] [2024-11-08 22:18:41,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629711264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:18:41,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:18:41,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-08 22:18:41,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369212352] [2024-11-08 22:18:41,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:18:41,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:18:41,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:18:41,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:18:41,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:18:41,075 INFO L87 Difference]: Start difference. First operand 124 states and 189 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-08 22:18:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:42,469 INFO L93 Difference]: Finished difference Result 205 states and 304 transitions. [2024-11-08 22:18:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 22:18:42,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 146 [2024-11-08 22:18:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:42,473 INFO L225 Difference]: With dead ends: 205 [2024-11-08 22:18:42,473 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 22:18:42,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-08 22:18:42,476 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 134 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:42,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 199 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 22:18:42,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 22:18:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 132. [2024-11-08 22:18:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 83 states have internal predecessors, (106), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 22:18:42,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2024-11-08 22:18:42,501 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 146 [2024-11-08 22:18:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:42,502 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2024-11-08 22:18:42,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2024-11-08 22:18:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2024-11-08 22:18:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 22:18:42,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:42,505 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:42,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 22:18:42,705 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 [2024-11-08 22:18:42,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:42,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:42,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2111984624, now seen corresponding path program 1 times [2024-11-08 22:18:42,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:18:42,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057033659] [2024-11-08 22:18:42,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:42,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:18:42,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:18:42,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:18:42,710 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 (6)] Waiting until timeout for monitored process [2024-11-08 22:18:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:42,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 22:18:42,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:18:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 327 proven. 12 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2024-11-08 22:18:43,105 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:18:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 51 proven. 12 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-08 22:18:43,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:18:43,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057033659] [2024-11-08 22:18:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057033659] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:18:43,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:18:43,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-08 22:18:43,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785951308] [2024-11-08 22:18:43,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:18:43,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 22:18:43,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:18:43,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 22:18:43,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 22:18:43,371 INFO L87 Difference]: Start difference. First operand 132 states and 194 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:18:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:18:44,669 INFO L93 Difference]: Finished difference Result 223 states and 316 transitions. [2024-11-08 22:18:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 22:18:44,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 147 [2024-11-08 22:18:44,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:18:44,672 INFO L225 Difference]: With dead ends: 223 [2024-11-08 22:18:44,673 INFO L226 Difference]: Without dead ends: 152 [2024-11-08 22:18:44,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-08 22:18:44,674 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 157 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:18:44,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 360 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 22:18:44,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-08 22:18:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2024-11-08 22:18:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 88 states have internal predecessors, (107), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 22:18:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 195 transitions. [2024-11-08 22:18:44,715 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 195 transitions. Word has length 147 [2024-11-08 22:18:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:18:44,715 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 195 transitions. [2024-11-08 22:18:44,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-08 22:18:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 195 transitions. [2024-11-08 22:18:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 22:18:44,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:18:44,720 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:18:44,733 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 (6)] Ended with exit code 0 [2024-11-08 22:18:44,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:18:44,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:18:44,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:18:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2113831666, now seen corresponding path program 1 times [2024-11-08 22:18:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:18:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101126203] [2024-11-08 22:18:44,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:18:44,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:18:44,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:18:44,926 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:18:44,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 22:18:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:18:45,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 22:18:45,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:19:09,147 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 22:19:30,531 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)