./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-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 153eaa15e8e0a77251d6fe10f88c717893889a67505536b5976381908daebffc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:05:34,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:05:34,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:05:34,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:05:34,654 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:05:34,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:05:34,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:05:34,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:05:34,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:05:34,691 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:05:34,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:05:34,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:05:34,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:05:34,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:05:34,695 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:05:34,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:05:34,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:05:34,696 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:05:34,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:05:34,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:05:34,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:05:34,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:05:34,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:05:34,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:05:34,698 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:05:34,699 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:05:34,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:05:34,699 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:05:34,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:05:34,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:05:34,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:05:34,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:05:34,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:05:34,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:05:34,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:05:34,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:05:34,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:05:34,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:05:34,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:05:34,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:05:34,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:05:34,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:05:34,704 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 -> 153eaa15e8e0a77251d6fe10f88c717893889a67505536b5976381908daebffc [2024-11-20 04:05:34,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:05:35,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:05:35,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:05:35,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:05:35,006 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:05:35,007 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-65.i [2024-11-20 04:05:36,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:05:36,678 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:05:36,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-65.i [2024-11-20 04:05:36,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9c06c02/49bf9104295f4d698a5b6bd9f676b988/FLAGcba0b2ce4 [2024-11-20 04:05:37,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9c06c02/49bf9104295f4d698a5b6bd9f676b988 [2024-11-20 04:05:37,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:05:37,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:05:37,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:05:37,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:05:37,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:05:37,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f63b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37, skipping insertion in model container [2024-11-20 04:05:37,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:05:37,390 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-pe-ci_file-65.i[919,932] [2024-11-20 04:05:37,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:05:37,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:05:37,523 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-pe-ci_file-65.i[919,932] [2024-11-20 04:05:37,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:05:37,601 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:05:37,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37 WrapperNode [2024-11-20 04:05:37,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:05:37,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:05:37,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:05:37,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:05:37,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,671 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2024-11-20 04:05:37,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:05:37,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:05:37,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:05:37,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:05:37,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,718 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 04:05:37,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,756 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:05:37,761 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:05:37,761 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:05:37,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:05:37,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (1/1) ... [2024-11-20 04:05:37,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:05:37,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:05:37,805 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 04:05:37,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 04:05:37,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:05:37,858 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:05:37,858 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:05:37,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:05:37,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:05:37,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:05:37,939 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:05:37,941 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:05:38,441 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 04:05:38,442 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:05:38,462 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:05:38,463 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:05:38,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:05:38 BoogieIcfgContainer [2024-11-20 04:05:38,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:05:38,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:05:38,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:05:38,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:05:38,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:05:37" (1/3) ... [2024-11-20 04:05:38,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e16461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:05:38, skipping insertion in model container [2024-11-20 04:05:38,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:37" (2/3) ... [2024-11-20 04:05:38,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e16461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:05:38, skipping insertion in model container [2024-11-20 04:05:38,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:05:38" (3/3) ... [2024-11-20 04:05:38,476 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-65.i [2024-11-20 04:05:38,494 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:05:38,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:05:38,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:05:38,569 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;@2cd0455c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:05:38,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:05:38,575 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-20 04:05:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 04:05:38,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:38,595 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-20 04:05:38,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:38,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:38,604 INFO L85 PathProgramCache]: Analyzing trace with hash 762336869, now seen corresponding path program 1 times [2024-11-20 04:05:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:38,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38687648] [2024-11-20 04:05:38,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:38,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:05:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:05:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:05:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,166 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-20 04:05:39,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:39,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38687648] [2024-11-20 04:05:39,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38687648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:39,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:39,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:05:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568835713] [2024-11-20 04:05:39,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:39,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:05:39,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:39,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:05:39,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:05:39,203 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-20 04:05:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:39,239 INFO L93 Difference]: Finished difference Result 197 states and 340 transitions. [2024-11-20 04:05:39,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:05:39,243 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-20 04:05:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:39,252 INFO L225 Difference]: With dead ends: 197 [2024-11-20 04:05:39,252 INFO L226 Difference]: Without dead ends: 97 [2024-11-20 04:05:39,257 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-20 04:05:39,262 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-20 04:05:39,264 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-20 04:05:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-20 04:05:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-20 04:05:39,315 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-20 04:05:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2024-11-20 04:05:39,323 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 152 [2024-11-20 04:05:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:39,324 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2024-11-20 04:05:39,324 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-20 04:05:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2024-11-20 04:05:39,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-20 04:05:39,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:39,328 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-20 04:05:39,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:05:39,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:39,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash -855621279, now seen corresponding path program 1 times [2024-11-20 04:05:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:39,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690003664] [2024-11-20 04:05:39,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:05:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:05:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:05:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:39,716 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-20 04:05:39,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:39,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690003664] [2024-11-20 04:05:39,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690003664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:39,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:39,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:05:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306842737] [2024-11-20 04:05:39,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:39,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:05:39,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:39,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:05:39,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:05:39,721 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-20 04:05:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:39,818 INFO L93 Difference]: Finished difference Result 285 states and 444 transitions. [2024-11-20 04:05:39,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:05:39,819 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-20 04:05:39,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:39,825 INFO L225 Difference]: With dead ends: 285 [2024-11-20 04:05:39,825 INFO L226 Difference]: Without dead ends: 191 [2024-11-20 04:05:39,826 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-20 04:05:39,827 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 134 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-20 04:05:39,827 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-20 04:05:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-20 04:05:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 134. [2024-11-20 04:05:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.5) internal successors, (165), 110 states have internal predecessors, (165), 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-20 04:05:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 209 transitions. [2024-11-20 04:05:39,863 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 209 transitions. Word has length 152 [2024-11-20 04:05:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:39,866 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 209 transitions. [2024-11-20 04:05:39,866 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-20 04:05:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 209 transitions. [2024-11-20 04:05:39,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 04:05:39,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:39,873 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-20 04:05:39,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:05:39,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:39,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:39,875 INFO L85 PathProgramCache]: Analyzing trace with hash -517633081, now seen corresponding path program 1 times [2024-11-20 04:05:39,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:39,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928418677] [2024-11-20 04:05:39,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:39,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:05:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:05:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:05:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,129 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-20 04:05:40,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:40,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928418677] [2024-11-20 04:05:40,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928418677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:40,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:40,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:05:40,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872342334] [2024-11-20 04:05:40,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:40,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:05:40,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:40,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:05:40,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:05:40,136 INFO L87 Difference]: Start difference. First operand 134 states and 209 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-20 04:05:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:40,167 INFO L93 Difference]: Finished difference Result 226 states and 348 transitions. [2024-11-20 04:05:40,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:05:40,168 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-20 04:05:40,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:40,172 INFO L225 Difference]: With dead ends: 226 [2024-11-20 04:05:40,173 INFO L226 Difference]: Without dead ends: 95 [2024-11-20 04:05:40,173 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-20 04:05:40,176 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:40,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:05:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-20 04:05:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-20 04:05:40,187 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-20 04:05:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2024-11-20 04:05:40,189 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 153 [2024-11-20 04:05:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:40,190 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2024-11-20 04:05:40,190 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-20 04:05:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2024-11-20 04:05:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 04:05:40,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:40,193 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-20 04:05:40,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:05:40,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:40,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1710820646, now seen corresponding path program 1 times [2024-11-20 04:05:40,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:40,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502763385] [2024-11-20 04:05:40,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:05:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:05:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:05:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,356 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-20 04:05:40,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:40,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502763385] [2024-11-20 04:05:40,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502763385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:40,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:40,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:05:40,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406023089] [2024-11-20 04:05:40,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:40,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:05:40,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:40,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:05:40,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:05:40,359 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-20 04:05:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:40,402 INFO L93 Difference]: Finished difference Result 277 states and 413 transitions. [2024-11-20 04:05:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:05:40,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-20 04:05:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:40,404 INFO L225 Difference]: With dead ends: 277 [2024-11-20 04:05:40,405 INFO L226 Difference]: Without dead ends: 185 [2024-11-20 04:05:40,405 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-20 04:05:40,406 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 123 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:40,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 343 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:05:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-20 04:05:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2024-11-20 04:05:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 136 states have internal predecessors, (183), 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-20 04:05:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 271 transitions. [2024-11-20 04:05:40,423 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 271 transitions. Word has length 154 [2024-11-20 04:05:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:40,424 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 271 transitions. [2024-11-20 04:05:40,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-20 04:05:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 271 transitions. [2024-11-20 04:05:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 04:05:40,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:40,426 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-20 04:05:40,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 04:05:40,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:40,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1317793636, now seen corresponding path program 1 times [2024-11-20 04:05:40,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:40,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040682082] [2024-11-20 04:05:40,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:40,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:05:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:05:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:05:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:40,772 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-20 04:05:40,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:40,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040682082] [2024-11-20 04:05:40,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040682082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:40,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:40,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:05:40,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847080218] [2024-11-20 04:05:40,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:40,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:05:40,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:40,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:05:40,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:05:40,776 INFO L87 Difference]: Start difference. First operand 183 states and 271 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-20 04:05:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:40,998 INFO L93 Difference]: Finished difference Result 617 states and 919 transitions. [2024-11-20 04:05:40,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:05:40,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-20 04:05:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:41,003 INFO L225 Difference]: With dead ends: 617 [2024-11-20 04:05:41,003 INFO L226 Difference]: Without dead ends: 437 [2024-11-20 04:05:41,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:05:41,005 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 303 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:41,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 399 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:05:41,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-20 04:05:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 201. [2024-11-20 04:05:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 154 states have internal predecessors, (210), 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-20 04:05:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 298 transitions. [2024-11-20 04:05:41,058 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 298 transitions. Word has length 154 [2024-11-20 04:05:41,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:41,058 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 298 transitions. [2024-11-20 04:05:41,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-20 04:05:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 298 transitions. [2024-11-20 04:05:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-20 04:05:41,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:41,060 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-20 04:05:41,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 04:05:41,061 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:41,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:41,063 INFO L85 PathProgramCache]: Analyzing trace with hash 743804516, now seen corresponding path program 1 times [2024-11-20 04:05:41,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:41,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498042506] [2024-11-20 04:05:41,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:41,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:05:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:05:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:05:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:41,935 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-20 04:05:41,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:41,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498042506] [2024-11-20 04:05:41,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498042506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:41,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:41,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 04:05:41,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85051740] [2024-11-20 04:05:41,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:41,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 04:05:41,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:41,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 04:05:41,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 04:05:41,938 INFO L87 Difference]: Start difference. First operand 201 states and 298 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-20 04:05:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:42,318 INFO L93 Difference]: Finished difference Result 442 states and 656 transitions. [2024-11-20 04:05:42,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 04:05:42,335 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-20 04:05:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:42,337 INFO L225 Difference]: With dead ends: 442 [2024-11-20 04:05:42,338 INFO L226 Difference]: Without dead ends: 244 [2024-11-20 04:05:42,338 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-20 04:05:42,339 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 336 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:42,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 628 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 04:05:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-20 04:05:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 201. [2024-11-20 04:05:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 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-20 04:05:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 297 transitions. [2024-11-20 04:05:42,371 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 297 transitions. Word has length 154 [2024-11-20 04:05:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:42,372 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 297 transitions. [2024-11-20 04:05:42,372 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-20 04:05:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 297 transitions. [2024-11-20 04:05:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 04:05:42,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:42,374 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] [2024-11-20 04:05:42,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 04:05:42,375 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:42,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:42,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1150874711, now seen corresponding path program 1 times [2024-11-20 04:05:42,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:42,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831131160] [2024-11-20 04:05:42,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:42,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:05:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:05:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:05:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:43,885 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-20 04:05:43,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:43,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831131160] [2024-11-20 04:05:43,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831131160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:43,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:43,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 04:05:43,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616788629] [2024-11-20 04:05:43,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:43,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 04:05:43,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:43,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 04:05:43,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:05:43,888 INFO L87 Difference]: Start difference. First operand 201 states and 297 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-20 04:05:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:45,036 INFO L93 Difference]: Finished difference Result 599 states and 859 transitions. [2024-11-20 04:05:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 04:05:45,037 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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 155 [2024-11-20 04:05:45,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:45,041 INFO L225 Difference]: With dead ends: 599 [2024-11-20 04:05:45,041 INFO L226 Difference]: Without dead ends: 401 [2024-11-20 04:05:45,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-20 04:05:45,043 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 621 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:45,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 330 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 04:05:45,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-20 04:05:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 225. [2024-11-20 04:05:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 172 states have (on average 1.308139534883721) internal successors, (225), 173 states have internal predecessors, (225), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-20 04:05:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 317 transitions. [2024-11-20 04:05:45,077 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 317 transitions. Word has length 155 [2024-11-20 04:05:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:45,078 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 317 transitions. [2024-11-20 04:05:45,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-20 04:05:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 317 transitions. [2024-11-20 04:05:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 04:05:45,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:45,080 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] [2024-11-20 04:05:45,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 04:05:45,080 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:45,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash 139757461, now seen corresponding path program 1 times [2024-11-20 04:05:45,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:45,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758342244] [2024-11-20 04:05:45,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:45,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:46,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:05:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:05:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:05:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:46,080 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-20 04:05:46,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758342244] [2024-11-20 04:05:46,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758342244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:46,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:46,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 04:05:46,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118558919] [2024-11-20 04:05:46,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:46,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 04:05:46,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:46,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 04:05:46,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:05:46,083 INFO L87 Difference]: Start difference. First operand 225 states and 317 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-20 04:05:46,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:46,817 INFO L93 Difference]: Finished difference Result 576 states and 800 transitions. [2024-11-20 04:05:46,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 04:05:46,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 155 [2024-11-20 04:05:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:46,821 INFO L225 Difference]: With dead ends: 576 [2024-11-20 04:05:46,821 INFO L226 Difference]: Without dead ends: 358 [2024-11-20 04:05:46,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-20 04:05:46,822 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 463 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:46,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 349 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 04:05:46,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-20 04:05:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 256. [2024-11-20 04:05:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 193 states have (on average 1.2901554404145077) internal successors, (249), 194 states have internal predecessors, (249), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-20 04:05:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 353 transitions. [2024-11-20 04:05:46,881 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 353 transitions. Word has length 155 [2024-11-20 04:05:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:46,882 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 353 transitions. [2024-11-20 04:05:46,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-20 04:05:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 353 transitions. [2024-11-20 04:05:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 04:05:46,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:46,886 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] [2024-11-20 04:05:46,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 04:05:46,886 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:46,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:46,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1404489321, now seen corresponding path program 1 times [2024-11-20 04:05:46,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:46,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377306237] [2024-11-20 04:05:46,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:46,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:05:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:05:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:05:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:47,629 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-20 04:05:47,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:47,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377306237] [2024-11-20 04:05:47,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377306237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:47,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:47,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 04:05:47,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558153779] [2024-11-20 04:05:47,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:47,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 04:05:47,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:47,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 04:05:47,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:05:47,632 INFO L87 Difference]: Start difference. First operand 256 states and 353 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-20 04:05:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:48,346 INFO L93 Difference]: Finished difference Result 625 states and 852 transitions. [2024-11-20 04:05:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 04:05:48,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 155 [2024-11-20 04:05:48,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:48,350 INFO L225 Difference]: With dead ends: 625 [2024-11-20 04:05:48,350 INFO L226 Difference]: Without dead ends: 385 [2024-11-20 04:05:48,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:05:48,352 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 377 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:48,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 923 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 04:05:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-20 04:05:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 290. [2024-11-20 04:05:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 210 states have (on average 1.2523809523809524) internal successors, (263), 211 states have internal predecessors, (263), 66 states have call successors, (66), 13 states have call predecessors, (66), 13 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-20 04:05:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 395 transitions. [2024-11-20 04:05:48,412 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 395 transitions. Word has length 155 [2024-11-20 04:05:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:48,412 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 395 transitions. [2024-11-20 04:05:48,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-20 04:05:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 395 transitions. [2024-11-20 04:05:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 04:05:48,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:48,415 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-20 04:05:48,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 04:05:48,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:48,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1192197914, now seen corresponding path program 1 times [2024-11-20 04:05:48,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:48,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23783711] [2024-11-20 04:05:48,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:48,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:05:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:05:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:05:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,799 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-20 04:05:48,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:48,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23783711] [2024-11-20 04:05:48,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23783711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:05:48,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434908974] [2024-11-20 04:05:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:48,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:05:48,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:05:48,807 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 04:05:48,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 04:05:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:48,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 04:05:48,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:05:49,210 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-20 04:05:49,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:05:49,507 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-20 04:05:49,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434908974] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:05:49,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:05:49,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-20 04:05:49,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279420666] [2024-11-20 04:05:49,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:05:49,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 04:05:49,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:49,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 04:05:49,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-20 04:05:49,510 INFO L87 Difference]: Start difference. First operand 290 states and 395 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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-20 04:05:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:49,928 INFO L93 Difference]: Finished difference Result 444 states and 596 transitions. [2024-11-20 04:05:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 04:05:49,929 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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 158 [2024-11-20 04:05:49,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:49,932 INFO L225 Difference]: With dead ends: 444 [2024-11-20 04:05:49,933 INFO L226 Difference]: Without dead ends: 204 [2024-11-20 04:05:49,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2024-11-20 04:05:49,934 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 341 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:49,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 299 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 04:05:49,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-20 04:05:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2024-11-20 04:05:49,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 137 states have (on average 1.2335766423357664) internal successors, (169), 138 states have internal predecessors, (169), 44 states have call successors, (44), 11 states have call predecessors, (44), 11 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 04:05:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 257 transitions. [2024-11-20 04:05:49,968 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 257 transitions. Word has length 158 [2024-11-20 04:05:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:49,969 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 257 transitions. [2024-11-20 04:05:49,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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-20 04:05:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 257 transitions. [2024-11-20 04:05:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 04:05:49,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:49,971 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-20 04:05:49,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 04:05:50,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 04:05:50,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:50,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash 594168388, now seen corresponding path program 1 times [2024-11-20 04:05:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:50,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849630990] [2024-11-20 04:05:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:05:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 04:05:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 04:05:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 04:05:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 04:05:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 04:05:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 04:05:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 04:05:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 04:05:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 04:05:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 04:05:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 04:05:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 04:05:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 04:05:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 04:05:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 04:05:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 04:05:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 04:05:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 04:05:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 04:05:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 04:05:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 04:05:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:50,879 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-20 04:05:50,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:05:50,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849630990] [2024-11-20 04:05:50,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849630990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:50,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:50,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 04:05:50,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993148996] [2024-11-20 04:05:50,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:50,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 04:05:50,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:05:50,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 04:05:50,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:05:50,882 INFO L87 Difference]: Start difference. First operand 193 states and 257 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-20 04:05:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:51,279 INFO L93 Difference]: Finished difference Result 304 states and 402 transitions. [2024-11-20 04:05:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 04:05:51,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 158 [2024-11-20 04:05:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:51,281 INFO L225 Difference]: With dead ends: 304 [2024-11-20 04:05:51,281 INFO L226 Difference]: Without dead ends: 169 [2024-11-20 04:05:51,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-20 04:05:51,282 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 311 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:51,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 204 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 04:05:51,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-20 04:05:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-20 04:05:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 114 states have internal predecessors, (131), 44 states have call successors, (44), 11 states have call predecessors, (44), 11 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 04:05:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 219 transitions. [2024-11-20 04:05:51,316 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 219 transitions. Word has length 158 [2024-11-20 04:05:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:51,316 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 219 transitions. [2024-11-20 04:05:51,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-20 04:05:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 219 transitions. [2024-11-20 04:05:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 04:05:51,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:51,319 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-20 04:05:51,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 04:05:51,320 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:51,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1857531699, now seen corresponding path program 1 times [2024-11-20 04:05:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:05:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014095359] [2024-11-20 04:05:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:51,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:05:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:05:51,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:05:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:05:51,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:05:51,497 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:05:51,498 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:05:51,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 04:05:51,503 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:05:51,640 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:05:51,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:05:51 BoogieIcfgContainer [2024-11-20 04:05:51,645 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:05:51,645 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:05:51,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:05:51,646 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:05:51,646 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:05:38" (3/4) ... [2024-11-20 04:05:51,648 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:05:51,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:05:51,650 INFO L158 Benchmark]: Toolchain (without parser) took 14604.99ms. Allocated memory was 165.7MB in the beginning and 388.0MB in the end (delta: 222.3MB). Free memory was 111.1MB in the beginning and 319.5MB in the end (delta: -208.4MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-20 04:05:51,650 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 96.5MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:05:51,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.76ms. Allocated memory is still 165.7MB. Free memory was 111.1MB in the beginning and 130.3MB in the end (delta: -19.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 04:05:51,651 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.16ms. Allocated memory is still 165.7MB. Free memory was 130.3MB in the beginning and 126.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:05:51,651 INFO L158 Benchmark]: Boogie Preprocessor took 87.56ms. Allocated memory is still 165.7MB. Free memory was 126.1MB in the beginning and 121.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:05:51,652 INFO L158 Benchmark]: RCFGBuilder took 703.23ms. Allocated memory is still 165.7MB. Free memory was 121.4MB in the beginning and 93.5MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-20 04:05:51,652 INFO L158 Benchmark]: TraceAbstraction took 13177.47ms. Allocated memory was 165.7MB in the beginning and 388.0MB in the end (delta: 222.3MB). Free memory was 93.2MB in the beginning and 320.6MB in the end (delta: -227.4MB). Peak memory consumption was 194.5MB. Max. memory is 16.1GB. [2024-11-20 04:05:51,652 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 388.0MB. Free memory was 320.6MB in the beginning and 319.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 04:05:51,654 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.67ms. Allocated memory is still 96.5MB. Free memory was 51.0MB in the beginning and 50.9MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.76ms. Allocated memory is still 165.7MB. Free memory was 111.1MB in the beginning and 130.3MB in the end (delta: -19.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.16ms. Allocated memory is still 165.7MB. Free memory was 130.3MB in the beginning and 126.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.56ms. Allocated memory is still 165.7MB. Free memory was 126.1MB in the beginning and 121.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 703.23ms. Allocated memory is still 165.7MB. Free memory was 121.4MB in the beginning and 93.5MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13177.47ms. Allocated memory was 165.7MB in the beginning and 388.0MB in the end (delta: 222.3MB). Free memory was 93.2MB in the beginning and 320.6MB in the end (delta: -227.4MB). Peak memory consumption was 194.5MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 388.0MB. Free memory was 320.6MB in the beginning and 319.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryArithmeticDOUBLEoperation at line 79. 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=300, 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=300, 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=300, 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=300, 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=300, 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=300, 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=300, var_1_13=65534, 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=300, var_1_13=65534, 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=300, var_1_13=65534, 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=300, var_1_13=65534, 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=300, var_1_13=65534, 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=300, var_1_13=65534, 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=300, var_1_13=65534, 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=300, var_1_13=65534, 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=300, var_1_13=65534, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=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] [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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=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] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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] signed long int stepLocal_3 = last_1_var_1_23; [L60] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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] [L61] COND FALSE !(last_1_var_1_23 < stepLocal_3) [L72] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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] [L74] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, 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] [L74] 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 [L75] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_20=500000004/5, var_1_23=-295, var_1_24=1, var_1_25=127, var_1_26=0, 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] [L79] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L80] var_1_28 = var_1_21 [L81] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=4, var_1_21=2147483652, var_1_23=-295, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, 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] [L82] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L83] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, 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] [L87] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) [L88] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, 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] [L89] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, 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] [L89] COND TRUE stepLocal_1 > (var_1_23 + (var_1_16 ^ var_1_16)) [L90] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, 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] [L92] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, 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] [L93] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, 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] [L97] var_1_29 = var_1_25 [L98] 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, stepLocal_2=0, var_1_11=0, var_1_12=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, 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] [L99] 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, 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] [L104] COND TRUE ((((var_1_28) < (var_1_21)) ? (var_1_28) : (var_1_21))) < var_1_28 [L105] var_1_33 = 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, stepLocal_2=0, var_1_11=0, var_1_12=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, 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] [L108] 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, stepLocal_2=0, var_1_11=0, var_1_12=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, var_1_33=0, var_1_39=0, 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] [L109] 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, stepLocal_2=0, var_1_11=0, var_1_12=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, var_1_33=0, var_1_39=0, 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] [L114] 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, stepLocal_2=0, var_1_11=0, var_1_12=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, var_1_33=0, var_1_39=0, 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] [L119] COND FALSE !(var_1_24 && var_1_14) [L122] var_1_45 = ((var_1_19 + var_1_12) + 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, stepLocal_2=0, var_1_11=0, var_1_12=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=300, var_1_47=16, var_1_50=2147483647, var_1_51=2147483647, var_1_8=64] [L124] COND FALSE !(var_1_22 < var_1_22) [L137] 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, stepLocal_2=0, var_1_11=0, var_1_12=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=300, var_1_47=300, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=300, var_1_47=300, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=300, var_1_47=300, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=300, var_1_47=300, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=300, var_1_47=300, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=300, var_1_47=300, 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=300, var_1_13=65534, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=0, var_1_1=300, var_1_21=2147483652, var_1_23=-295, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=2147483652, var_1_29=127, var_1_31=0, var_1_33=0, var_1_39=0, var_1_41=-5, var_1_42=248/5, var_1_45=300, var_1_47=300, 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: 13.0s, OverallIterations: 12, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3015 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3009 mSDsluCounter, 4297 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2120 mSDsCounter, 631 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1686 IncrementalHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 631 mSolverCounterUnsat, 2177 mSDtfsCounter, 1686 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 931 GetRequests, 863 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=9, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 722 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2017 NumberOfCodeBlocks, 2017 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2003 ConstructedInterpolants, 0 QuantifiedInterpolants, 8378 SizeOfPredicates, 2 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 11877/12012 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 04:05:51,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-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 153eaa15e8e0a77251d6fe10f88c717893889a67505536b5976381908daebffc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:05:53,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:05:54,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:05:54,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:05:54,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:05:54,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:05:54,057 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:05:54,057 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:05:54,058 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:05:54,058 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:05:54,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:05:54,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:05:54,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:05:54,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:05:54,060 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:05:54,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:05:54,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:05:54,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:05:54,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:05:54,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:05:54,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:05:54,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:05:54,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:05:54,063 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:05:54,063 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:05:54,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:05:54,064 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:05:54,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:05:54,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:05:54,065 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:05:54,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:05:54,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:05:54,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:05:54,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:05:54,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:05:54,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:05:54,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:05:54,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:05:54,071 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:05:54,071 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:05:54,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:05:54,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:05:54,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:05:54,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:05:54,073 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 -> 153eaa15e8e0a77251d6fe10f88c717893889a67505536b5976381908daebffc [2024-11-20 04:05:54,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:05:54,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:05:54,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:05:54,451 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:05:54,451 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:05:54,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-65.i [2024-11-20 04:05:55,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:05:56,267 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:05:56,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-65.i [2024-11-20 04:05:56,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29df25f46/26422bdaf562434b820e6a3041e35bea/FLAGc554fb6d4 [2024-11-20 04:05:56,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29df25f46/26422bdaf562434b820e6a3041e35bea [2024-11-20 04:05:56,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:05:56,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:05:56,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:05:56,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:05:56,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:05:56,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757bb229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56, skipping insertion in model container [2024-11-20 04:05:56,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:05:56,546 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-pe-ci_file-65.i[919,932] [2024-11-20 04:05:56,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:05:56,661 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:05:56,676 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-pe-ci_file-65.i[919,932] [2024-11-20 04:05:56,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:05:56,732 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:05:56,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56 WrapperNode [2024-11-20 04:05:56,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:05:56,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:05:56,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:05:56,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:05:56,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,799 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-20 04:05:56,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:05:56,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:05:56,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:05:56,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:05:56,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,855 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 04:05:56,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,871 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:05:56,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:05:56,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:05:56,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:05:56,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (1/1) ... [2024-11-20 04:05:56,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:05:56,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:05:56,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 04:05:56,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 04:05:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:05:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:05:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:05:56,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:05:56,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:05:56,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:05:57,080 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:05:57,083 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:05:58,741 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-20 04:05:58,742 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:05:58,755 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:05:58,756 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:05:58,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:05:58 BoogieIcfgContainer [2024-11-20 04:05:58,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:05:58,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:05:58,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:05:58,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:05:58,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:05:56" (1/3) ... [2024-11-20 04:05:58,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715038a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:05:58, skipping insertion in model container [2024-11-20 04:05:58,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:05:56" (2/3) ... [2024-11-20 04:05:58,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715038a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:05:58, skipping insertion in model container [2024-11-20 04:05:58,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:05:58" (3/3) ... [2024-11-20 04:05:58,763 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-65.i [2024-11-20 04:05:58,786 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:05:58,787 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:05:58,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:05:58,865 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;@5e110aae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:05:58,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:05:58,872 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-20 04:05:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 04:05:58,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:58,887 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-20 04:05:58,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:58,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash -326611704, now seen corresponding path program 1 times [2024-11-20 04:05:58,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:05:58,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678838931] [2024-11-20 04:05:58,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:58,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:05:58,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:05:58,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:05:58,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 04:05:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:05:59,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 04:05:59,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:05:59,402 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-20 04:05:59,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:05:59,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:05:59,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678838931] [2024-11-20 04:05:59,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678838931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:05:59,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:05:59,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:05:59,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991553893] [2024-11-20 04:05:59,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:05:59,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:05:59,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:05:59,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:05:59,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:05:59,448 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-20 04:05:59,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:05:59,484 INFO L93 Difference]: Finished difference Result 144 states and 252 transitions. [2024-11-20 04:05:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:05:59,487 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-20 04:05:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:05:59,497 INFO L225 Difference]: With dead ends: 144 [2024-11-20 04:05:59,497 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 04:05:59,502 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-20 04:05:59,506 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:05:59,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:05:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 04:05:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-20 04:05:59,554 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-20 04:05:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-20 04:05:59,561 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 146 [2024-11-20 04:05:59,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:05:59,561 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-20 04:05:59,561 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-20 04:05:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-20 04:05:59,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 04:05:59,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:05:59,566 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-20 04:05:59,580 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 (2)] Forceful destruction successful, exit code 0 [2024-11-20 04:05:59,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:05:59,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:05:59,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:05:59,773 INFO L85 PathProgramCache]: Analyzing trace with hash 34564422, now seen corresponding path program 1 times [2024-11-20 04:05:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:05:59,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983640233] [2024-11-20 04:05:59,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:05:59,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:05:59,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:05:59,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:05:59,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 04:06:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:06:00,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 04:06:00,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:06:00,585 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-20 04:06:00,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:06:00,938 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-20 04:06:00,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:06:00,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983640233] [2024-11-20 04:06:00,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983640233] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:06:00,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:06:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-20 04:06:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752998371] [2024-11-20 04:06:00,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:06:00,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 04:06:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:06:00,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 04:06:00,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 04:06:00,944 INFO L87 Difference]: Start difference. First operand 70 states and 106 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-20 04:06:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:06:02,545 INFO L93 Difference]: Finished difference Result 156 states and 233 transitions. [2024-11-20 04:06:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 04:06:02,546 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-20 04:06:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:06:02,552 INFO L225 Difference]: With dead ends: 156 [2024-11-20 04:06:02,552 INFO L226 Difference]: Without dead ends: 89 [2024-11-20 04:06:02,553 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-20 04:06:02,554 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 149 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 04:06:02,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 202 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 04:06:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-20 04:06:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2024-11-20 04:06:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 54 states have internal predecessors, (68), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 04:06:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-11-20 04:06:02,573 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 146 [2024-11-20 04:06:02,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:06:02,574 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-11-20 04:06:02,574 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-20 04:06:02,574 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-11-20 04:06:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 04:06:02,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:06:02,576 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-20 04:06:02,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 04:06:02,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:06:02,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:06:02,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:06:02,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1745634194, now seen corresponding path program 1 times [2024-11-20 04:06:02,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:06:02,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498180877] [2024-11-20 04:06:02,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:06:02,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:06:02,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:06:02,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:06:02,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 04:06:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:06:03,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 04:06:03,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:06:03,074 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-20 04:06:03,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:06:03,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:06:03,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498180877] [2024-11-20 04:06:03,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498180877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:06:03,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:06:03,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:06:03,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936960054] [2024-11-20 04:06:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:06:03,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:06:03,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:06:03,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:06:03,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:06:03,079 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (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-20 04:06:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:06:04,124 INFO L93 Difference]: Finished difference Result 170 states and 246 transitions. [2024-11-20 04:06:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:06:04,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (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 147 [2024-11-20 04:06:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:06:04,127 INFO L225 Difference]: With dead ends: 170 [2024-11-20 04:06:04,127 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 04:06:04,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:06:04,131 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 53 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:06:04,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 195 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 04:06:04,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 04:06:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-11-20 04:06:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 04:06:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2024-11-20 04:06:04,160 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 147 [2024-11-20 04:06:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:06:04,163 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2024-11-20 04:06:04,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (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-20 04:06:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2024-11-20 04:06:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 04:06:04,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:06:04,166 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-20 04:06:04,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 04:06:04,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:06:04,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:06:04,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:06:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1352607184, now seen corresponding path program 1 times [2024-11-20 04:06:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:06:04,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784076742] [2024-11-20 04:06:04,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:06:04,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:06:04,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:06:04,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 04:06:04,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 04:06:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:06:04,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 04:06:04,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:06:04,870 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-20 04:06:04,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:06:05,128 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-20 04:06:05,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:06:05,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784076742] [2024-11-20 04:06:05,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784076742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:06:05,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 04:06:05,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-20 04:06:05,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661218297] [2024-11-20 04:06:05,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 04:06:05,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 04:06:05,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:06:05,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 04:06:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:06:05,131 INFO L87 Difference]: Start difference. First operand 98 states and 139 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-20 04:06:06,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:06:06,810 INFO L93 Difference]: Finished difference Result 223 states and 308 transitions. [2024-11-20 04:06:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 04:06:06,810 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-20 04:06:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:06:06,813 INFO L225 Difference]: With dead ends: 223 [2024-11-20 04:06:06,813 INFO L226 Difference]: Without dead ends: 148 [2024-11-20 04:06:06,814 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-20 04:06:06,814 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 156 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 04:06:06,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 303 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 04:06:06,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-20 04:06:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 128. [2024-11-20 04:06:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 76 states have (on average 1.131578947368421) internal successors, (86), 77 states have internal predecessors, (86), 44 states have call successors, (44), 7 states have call predecessors, (44), 7 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 04:06:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 174 transitions. [2024-11-20 04:06:06,857 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 174 transitions. Word has length 147 [2024-11-20 04:06:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:06:06,859 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 174 transitions. [2024-11-20 04:06:06,860 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-20 04:06:06,860 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 174 transitions. [2024-11-20 04:06:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 04:06:06,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:06:06,865 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-20 04:06:06,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 04:06:07,066 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-20 04:06:07,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:06:07,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:06:07,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1409865486, now seen corresponding path program 1 times [2024-11-20 04:06:07,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:06:07,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556343162] [2024-11-20 04:06:07,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:06:07,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 04:06:07,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:06:07,070 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-20 04:06:07,071 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-20 04:06:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:06:07,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 04:06:07,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:06:34,458 WARN L286 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)