./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.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 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:13:37,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:13:37,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:13:37,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:13:37,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:13:37,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:13:37,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:13:37,632 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:13:37,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:13:37,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:13:37,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:13:37,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:13:37,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:13:37,637 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:13:37,638 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:13:37,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:13:37,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:13:37,640 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:13:37,640 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:13:37,640 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:13:37,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:13:37,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:13:37,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:13:37,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:13:37,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:13:37,642 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:13:37,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:13:37,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:13:37,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:13:37,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:13:37,643 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:13:37,643 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:13:37,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:13:37,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:13:37,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:13:37,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:13:37,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:13:37,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:13:37,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:13:37,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:13:37,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:13:37,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:13:37,652 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 -> 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 [2024-11-12 03:13:37,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:13:37,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:13:37,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:13:37,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:13:37,905 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:13:37,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-11-12 03:13:39,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:13:39,348 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:13:39,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-11-12 03:13:39,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc24ca7f/1e7c7db8ae1d412fb6121e246c99e426/FLAG26a234171 [2024-11-12 03:13:39,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc24ca7f/1e7c7db8ae1d412fb6121e246c99e426 [2024-11-12 03:13:39,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:13:39,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:13:39,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:13:39,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:13:39,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:13:39,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b2bc8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39, skipping insertion in model container [2024-11-12 03:13:39,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:13:39,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i[919,932] [2024-11-12 03:13:39,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:13:39,628 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:13:39,637 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-co_file-63.i[919,932] [2024-11-12 03:13:39,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:13:39,682 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:13:39,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39 WrapperNode [2024-11-12 03:13:39,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:13:39,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:13:39,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:13:39,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:13:39,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,742 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 285 [2024-11-12 03:13:39,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:13:39,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:13:39,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:13:39,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:13:39,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,759 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,778 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-12 03:13:39,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:13:39,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:13:39,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:13:39,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:13:39,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (1/1) ... [2024-11-12 03:13:39,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:13:39,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:13:39,863 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-12 03:13:39,865 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-12 03:13:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:13:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:13:39,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:13:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:13:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:13:39,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:13:39,978 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:13:39,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:13:40,391 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-12 03:13:40,392 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:13:40,405 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:13:40,406 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:13:40,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:13:40 BoogieIcfgContainer [2024-11-12 03:13:40,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:13:40,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:13:40,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:13:40,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:13:40,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:13:39" (1/3) ... [2024-11-12 03:13:40,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7d7c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:13:40, skipping insertion in model container [2024-11-12 03:13:40,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:13:39" (2/3) ... [2024-11-12 03:13:40,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7d7c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:13:40, skipping insertion in model container [2024-11-12 03:13:40,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:13:40" (3/3) ... [2024-11-12 03:13:40,447 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-11-12 03:13:40,487 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:13:40,487 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:13:40,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:13:40,543 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;@3db6cae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:13:40,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:13:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 03:13:40,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-12 03:13:40,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:40,561 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:40,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:40,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1338512759, now seen corresponding path program 1 times [2024-11-12 03:13:40,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:40,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161793621] [2024-11-12 03:13:40,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:40,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:40,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161793621] [2024-11-12 03:13:40,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161793621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:40,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:40,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:13:40,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612865849] [2024-11-12 03:13:40,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:40,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:13:41,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:41,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:13:41,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:13:41,024 INFO L87 Difference]: Start difference. First operand has 116 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 82 states have internal predecessors, (116), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-12 03:13:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:41,052 INFO L93 Difference]: Finished difference Result 225 states and 386 transitions. [2024-11-12 03:13:41,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:13:41,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 216 [2024-11-12 03:13:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:41,064 INFO L225 Difference]: With dead ends: 225 [2024-11-12 03:13:41,064 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 03:13:41,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-12 03:13:41,070 INFO L435 NwaCegarLoop]: 173 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, 173 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-12 03:13:41,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:13:41,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 03:13:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-12 03:13:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 03:13:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2024-11-12 03:13:41,120 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 216 [2024-11-12 03:13:41,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:41,120 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2024-11-12 03:13:41,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-12 03:13:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2024-11-12 03:13:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-12 03:13:41,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:41,128 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:41,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:13:41,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:41,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2009710045, now seen corresponding path program 1 times [2024-11-12 03:13:41,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:41,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643756356] [2024-11-12 03:13:41,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:41,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:41,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:41,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643756356] [2024-11-12 03:13:41,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643756356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:41,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:41,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:13:41,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888723527] [2024-11-12 03:13:41,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:41,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:13:41,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:41,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:13:41,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:13:41,526 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:41,598 INFO L93 Difference]: Finished difference Result 269 states and 418 transitions. [2024-11-12 03:13:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:13:41,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2024-11-12 03:13:41,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:41,605 INFO L225 Difference]: With dead ends: 269 [2024-11-12 03:13:41,605 INFO L226 Difference]: Without dead ends: 160 [2024-11-12 03:13:41,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-12 03:13:41,609 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 73 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:41,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 326 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:13:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-12 03:13:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 125. [2024-11-12 03:13:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 91 states have internal predecessors, (128), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 03:13:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 192 transitions. [2024-11-12 03:13:41,627 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 192 transitions. Word has length 216 [2024-11-12 03:13:41,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:41,629 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 192 transitions. [2024-11-12 03:13:41,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 192 transitions. [2024-11-12 03:13:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-12 03:13:41,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:41,636 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:41,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:13:41,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:41,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:41,638 INFO L85 PathProgramCache]: Analyzing trace with hash -86482011, now seen corresponding path program 1 times [2024-11-12 03:13:41,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:41,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614397128] [2024-11-12 03:13:41,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:41,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:42,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:42,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614397128] [2024-11-12 03:13:42,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614397128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:42,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:42,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 03:13:42,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077651085] [2024-11-12 03:13:42,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:42,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 03:13:42,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:42,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 03:13:42,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:13:42,732 INFO L87 Difference]: Start difference. First operand 125 states and 192 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:43,759 INFO L93 Difference]: Finished difference Result 522 states and 797 transitions. [2024-11-12 03:13:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 03:13:43,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2024-11-12 03:13:43,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:43,763 INFO L225 Difference]: With dead ends: 522 [2024-11-12 03:13:43,763 INFO L226 Difference]: Without dead ends: 400 [2024-11-12 03:13:43,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-11-12 03:13:43,765 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 818 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:43,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 1276 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 03:13:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-12 03:13:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 183. [2024-11-12 03:13:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 149 states have (on average 1.483221476510067) internal successors, (221), 149 states have internal predecessors, (221), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 03:13:43,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 285 transitions. [2024-11-12 03:13:43,793 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 285 transitions. Word has length 216 [2024-11-12 03:13:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:43,794 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 285 transitions. [2024-11-12 03:13:43,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 285 transitions. [2024-11-12 03:13:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-12 03:13:43,798 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:43,798 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:43,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:13:43,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:43,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:43,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1891920345, now seen corresponding path program 1 times [2024-11-12 03:13:43,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:43,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224173728] [2024-11-12 03:13:43,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:43,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:43,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:43,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:43,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:43,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:43,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:43,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:44,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:44,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224173728] [2024-11-12 03:13:44,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224173728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:44,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:44,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:13:44,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767736352] [2024-11-12 03:13:44,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:44,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:13:44,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:44,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:13:44,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:13:44,060 INFO L87 Difference]: Start difference. First operand 183 states and 285 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:44,259 INFO L93 Difference]: Finished difference Result 691 states and 1082 transitions. [2024-11-12 03:13:44,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:13:44,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2024-11-12 03:13:44,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:44,262 INFO L225 Difference]: With dead ends: 691 [2024-11-12 03:13:44,263 INFO L226 Difference]: Without dead ends: 511 [2024-11-12 03:13:44,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:13:44,264 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 428 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:44,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 683 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:13:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-12 03:13:44,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 347. [2024-11-12 03:13:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 280 states have (on average 1.4714285714285715) internal successors, (412), 280 states have internal predecessors, (412), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 03:13:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 540 transitions. [2024-11-12 03:13:44,297 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 540 transitions. Word has length 216 [2024-11-12 03:13:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:44,297 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 540 transitions. [2024-11-12 03:13:44,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 540 transitions. [2024-11-12 03:13:44,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-12 03:13:44,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:44,301 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:44,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:13:44,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:44,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1500236955, now seen corresponding path program 1 times [2024-11-12 03:13:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:44,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194041923] [2024-11-12 03:13:44,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:44,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:44,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:44,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194041923] [2024-11-12 03:13:44,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194041923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:44,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:44,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:13:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040978311] [2024-11-12 03:13:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:44,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:13:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:44,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:13:44,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:13:44,469 INFO L87 Difference]: Start difference. First operand 347 states and 540 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:44,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:44,502 INFO L93 Difference]: Finished difference Result 755 states and 1174 transitions. [2024-11-12 03:13:44,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:13:44,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2024-11-12 03:13:44,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:44,506 INFO L225 Difference]: With dead ends: 755 [2024-11-12 03:13:44,507 INFO L226 Difference]: Without dead ends: 411 [2024-11-12 03:13:44,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-12 03:13:44,509 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 65 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:44,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 395 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:13:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-12 03:13:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 347. [2024-11-12 03:13:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 280 states have (on average 1.4464285714285714) internal successors, (405), 280 states have internal predecessors, (405), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 03:13:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 533 transitions. [2024-11-12 03:13:44,527 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 533 transitions. Word has length 216 [2024-11-12 03:13:44,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:44,528 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 533 transitions. [2024-11-12 03:13:44,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 533 transitions. [2024-11-12 03:13:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-12 03:13:44,530 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:44,530 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:44,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 03:13:44,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:44,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:44,531 INFO L85 PathProgramCache]: Analyzing trace with hash 759736933, now seen corresponding path program 1 times [2024-11-12 03:13:44,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:44,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667930265] [2024-11-12 03:13:44,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:44,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:44,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:44,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667930265] [2024-11-12 03:13:44,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667930265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:44,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:44,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:13:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378422324] [2024-11-12 03:13:44,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:44,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:13:44,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:13:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:13:44,706 INFO L87 Difference]: Start difference. First operand 347 states and 533 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:44,768 INFO L93 Difference]: Finished difference Result 957 states and 1467 transitions. [2024-11-12 03:13:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:13:44,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2024-11-12 03:13:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:44,772 INFO L225 Difference]: With dead ends: 957 [2024-11-12 03:13:44,772 INFO L226 Difference]: Without dead ends: 613 [2024-11-12 03:13:44,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-12 03:13:44,776 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 140 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:44,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 356 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:13:44,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-11-12 03:13:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 463. [2024-11-12 03:13:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 396 states have (on average 1.4747474747474747) internal successors, (584), 396 states have internal predecessors, (584), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 03:13:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 712 transitions. [2024-11-12 03:13:44,825 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 712 transitions. Word has length 217 [2024-11-12 03:13:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:44,825 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 712 transitions. [2024-11-12 03:13:44,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 712 transitions. [2024-11-12 03:13:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-12 03:13:44,832 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:44,832 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:44,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 03:13:44,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:44,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1219225526, now seen corresponding path program 1 times [2024-11-12 03:13:44,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:44,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417035808] [2024-11-12 03:13:44,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:44,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:45,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:45,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417035808] [2024-11-12 03:13:45,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417035808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:45,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:45,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 03:13:45,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997476638] [2024-11-12 03:13:45,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:45,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 03:13:45,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:45,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 03:13:45,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:13:45,238 INFO L87 Difference]: Start difference. First operand 463 states and 712 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:46,101 INFO L93 Difference]: Finished difference Result 1658 states and 2557 transitions. [2024-11-12 03:13:46,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 03:13:46,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2024-11-12 03:13:46,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:46,108 INFO L225 Difference]: With dead ends: 1658 [2024-11-12 03:13:46,109 INFO L226 Difference]: Without dead ends: 1425 [2024-11-12 03:13:46,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:13:46,110 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 761 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:46,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 655 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 03:13:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-11-12 03:13:46,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 471. [2024-11-12 03:13:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 404 states have (on average 1.4801980198019802) internal successors, (598), 404 states have internal predecessors, (598), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 03:13:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 726 transitions. [2024-11-12 03:13:46,171 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 726 transitions. Word has length 217 [2024-11-12 03:13:46,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:46,171 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 726 transitions. [2024-11-12 03:13:46,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 726 transitions. [2024-11-12 03:13:46,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-12 03:13:46,174 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:46,176 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:46,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 03:13:46,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:46,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:46,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1353239032, now seen corresponding path program 1 times [2024-11-12 03:13:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:46,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647423600] [2024-11-12 03:13:46,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:46,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:46,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:46,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647423600] [2024-11-12 03:13:46,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647423600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:46,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:46,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:13:46,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631606166] [2024-11-12 03:13:46,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:46,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:13:46,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:13:46,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:13:46,393 INFO L87 Difference]: Start difference. First operand 471 states and 726 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:46,642 INFO L93 Difference]: Finished difference Result 1180 states and 1827 transitions. [2024-11-12 03:13:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:13:46,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2024-11-12 03:13:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:46,647 INFO L225 Difference]: With dead ends: 1180 [2024-11-12 03:13:46,647 INFO L226 Difference]: Without dead ends: 712 [2024-11-12 03:13:46,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 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-12 03:13:46,649 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 386 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:46,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 322 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:13:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-12 03:13:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 554. [2024-11-12 03:13:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 487 states have (on average 1.4989733059548254) internal successors, (730), 487 states have internal predecessors, (730), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 03:13:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 858 transitions. [2024-11-12 03:13:46,713 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 858 transitions. Word has length 217 [2024-11-12 03:13:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:46,713 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 858 transitions. [2024-11-12 03:13:46,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 858 transitions. [2024-11-12 03:13:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-12 03:13:46,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:46,717 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:46,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 03:13:46,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:46,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:46,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1078676916, now seen corresponding path program 1 times [2024-11-12 03:13:46,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:46,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522847335] [2024-11-12 03:13:46,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:46,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:47,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:47,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522847335] [2024-11-12 03:13:47,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522847335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:47,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:47,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:13:47,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301701508] [2024-11-12 03:13:47,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:47,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:13:47,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:47,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:13:47,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:13:47,038 INFO L87 Difference]: Start difference. First operand 554 states and 858 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:47,531 INFO L93 Difference]: Finished difference Result 1272 states and 1963 transitions. [2024-11-12 03:13:47,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:13:47,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2024-11-12 03:13:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:47,536 INFO L225 Difference]: With dead ends: 1272 [2024-11-12 03:13:47,536 INFO L226 Difference]: Without dead ends: 721 [2024-11-12 03:13:47,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:13:47,538 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 377 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:47,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 588 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:13:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-11-12 03:13:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 450. [2024-11-12 03:13:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 383 states have (on average 1.4621409921671018) internal successors, (560), 383 states have internal predecessors, (560), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 03:13:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 688 transitions. [2024-11-12 03:13:47,586 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 688 transitions. Word has length 217 [2024-11-12 03:13:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:47,587 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 688 transitions. [2024-11-12 03:13:47,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 688 transitions. [2024-11-12 03:13:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-12 03:13:47,589 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:47,590 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:47,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 03:13:47,590 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:47,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1174885442, now seen corresponding path program 1 times [2024-11-12 03:13:47,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:47,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300378222] [2024-11-12 03:13:47,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:47,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:47,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:47,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300378222] [2024-11-12 03:13:47,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300378222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:47,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:47,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 03:13:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129387117] [2024-11-12 03:13:47,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:47,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 03:13:47,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:47,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 03:13:47,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:13:47,939 INFO L87 Difference]: Start difference. First operand 450 states and 688 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:48,350 INFO L93 Difference]: Finished difference Result 1168 states and 1792 transitions. [2024-11-12 03:13:48,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 03:13:48,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2024-11-12 03:13:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:48,354 INFO L225 Difference]: With dead ends: 1168 [2024-11-12 03:13:48,354 INFO L226 Difference]: Without dead ends: 653 [2024-11-12 03:13:48,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:13:48,356 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 138 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:48,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1085 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:13:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-12 03:13:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 501. [2024-11-12 03:13:48,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 434 states have (on average 1.4723502304147464) internal successors, (639), 434 states have internal predecessors, (639), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 03:13:48,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 767 transitions. [2024-11-12 03:13:48,416 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 767 transitions. Word has length 217 [2024-11-12 03:13:48,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:48,417 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 767 transitions. [2024-11-12 03:13:48,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 767 transitions. [2024-11-12 03:13:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 03:13:48,420 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:48,420 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:48,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 03:13:48,420 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:48,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash 751022440, now seen corresponding path program 1 times [2024-11-12 03:13:48,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:48,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302472516] [2024-11-12 03:13:48,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302472516] [2024-11-12 03:13:48,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302472516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:48,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:48,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 03:13:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908430343] [2024-11-12 03:13:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:48,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:13:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:48,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:13:48,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:13:48,693 INFO L87 Difference]: Start difference. First operand 501 states and 767 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:49,498 INFO L93 Difference]: Finished difference Result 1376 states and 2103 transitions. [2024-11-12 03:13:49,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 03:13:49,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 218 [2024-11-12 03:13:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:49,503 INFO L225 Difference]: With dead ends: 1376 [2024-11-12 03:13:49,503 INFO L226 Difference]: Without dead ends: 878 [2024-11-12 03:13:49,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:13:49,504 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 466 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:49,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1281 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 03:13:49,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-11-12 03:13:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 505. [2024-11-12 03:13:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 438 states have (on average 1.4543378995433789) internal successors, (637), 438 states have internal predecessors, (637), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 03:13:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 765 transitions. [2024-11-12 03:13:49,572 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 765 transitions. Word has length 218 [2024-11-12 03:13:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:49,573 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 765 transitions. [2024-11-12 03:13:49,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 765 transitions. [2024-11-12 03:13:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 03:13:49,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:49,576 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 03:13:49,576 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:49,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1955596954, now seen corresponding path program 1 times [2024-11-12 03:13:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320434080] [2024-11-12 03:13:49,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:51,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:51,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320434080] [2024-11-12 03:13:51,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320434080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:51,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:51,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 03:13:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840082335] [2024-11-12 03:13:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:51,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 03:13:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:51,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 03:13:51,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-12 03:13:51,463 INFO L87 Difference]: Start difference. First operand 505 states and 765 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:52,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:52,848 INFO L93 Difference]: Finished difference Result 1300 states and 1931 transitions. [2024-11-12 03:13:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 03:13:52,849 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 218 [2024-11-12 03:13:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:52,853 INFO L225 Difference]: With dead ends: 1300 [2024-11-12 03:13:52,853 INFO L226 Difference]: Without dead ends: 1038 [2024-11-12 03:13:52,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-12 03:13:52,854 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 320 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:52,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1500 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 03:13:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-11-12 03:13:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 918. [2024-11-12 03:13:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 845 states have (on average 1.4745562130177514) internal successors, (1246), 847 states have internal predecessors, (1246), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 03:13:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1382 transitions. [2024-11-12 03:13:52,919 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1382 transitions. Word has length 218 [2024-11-12 03:13:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:52,920 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1382 transitions. [2024-11-12 03:13:52,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1382 transitions. [2024-11-12 03:13:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 03:13:52,922 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:52,922 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:52,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 03:13:52,923 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:52,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:52,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1318301988, now seen corresponding path program 1 times [2024-11-12 03:13:52,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:52,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659930473] [2024-11-12 03:13:52,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:53,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659930473] [2024-11-12 03:13:53,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659930473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:53,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:53,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:13:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730768944] [2024-11-12 03:13:53,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:53,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:13:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:53,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:13:53,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:13:53,520 INFO L87 Difference]: Start difference. First operand 918 states and 1382 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:53,728 INFO L93 Difference]: Finished difference Result 1392 states and 2093 transitions. [2024-11-12 03:13:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:13:53,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 218 [2024-11-12 03:13:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:53,732 INFO L225 Difference]: With dead ends: 1392 [2024-11-12 03:13:53,733 INFO L226 Difference]: Without dead ends: 905 [2024-11-12 03:13:53,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:13:53,735 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 84 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:53,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 592 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:13:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-12 03:13:53,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 901. [2024-11-12 03:13:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 828 states have (on average 1.4758454106280192) internal successors, (1222), 830 states have internal predecessors, (1222), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 03:13:53,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1358 transitions. [2024-11-12 03:13:53,831 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1358 transitions. Word has length 218 [2024-11-12 03:13:53,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:53,832 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1358 transitions. [2024-11-12 03:13:53,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:53,832 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1358 transitions. [2024-11-12 03:13:53,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 03:13:53,835 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:53,835 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:53,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 03:13:53,836 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:53,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1893557340, now seen corresponding path program 1 times [2024-11-12 03:13:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:53,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797243291] [2024-11-12 03:13:53,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:53,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:54,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:54,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797243291] [2024-11-12 03:13:54,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797243291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:54,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:54,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 03:13:54,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157948151] [2024-11-12 03:13:54,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:54,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:13:54,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:13:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:13:54,327 INFO L87 Difference]: Start difference. First operand 901 states and 1358 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:54,577 INFO L93 Difference]: Finished difference Result 1997 states and 3022 transitions. [2024-11-12 03:13:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 03:13:54,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 218 [2024-11-12 03:13:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:54,584 INFO L225 Difference]: With dead ends: 1997 [2024-11-12 03:13:54,584 INFO L226 Difference]: Without dead ends: 1527 [2024-11-12 03:13:54,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:13:54,585 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 243 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:54,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 973 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:13:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2024-11-12 03:13:54,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 939. [2024-11-12 03:13:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 866 states have (on average 1.4734411085450347) internal successors, (1276), 868 states have internal predecessors, (1276), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 03:13:54,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1412 transitions. [2024-11-12 03:13:54,651 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1412 transitions. Word has length 218 [2024-11-12 03:13:54,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:54,651 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1412 transitions. [2024-11-12 03:13:54,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1412 transitions. [2024-11-12 03:13:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 03:13:54,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:54,654 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:54,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 03:13:54,654 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:54,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1387989502, now seen corresponding path program 1 times [2024-11-12 03:13:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:54,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738031394] [2024-11-12 03:13:54,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:54,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:55,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:55,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738031394] [2024-11-12 03:13:55,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738031394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:55,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:55,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 03:13:55,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886116891] [2024-11-12 03:13:55,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:55,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:13:55,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:55,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:13:55,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:13:55,023 INFO L87 Difference]: Start difference. First operand 939 states and 1412 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:55,371 INFO L93 Difference]: Finished difference Result 2705 states and 4108 transitions. [2024-11-12 03:13:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 03:13:55,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 218 [2024-11-12 03:13:55,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:55,377 INFO L225 Difference]: With dead ends: 2705 [2024-11-12 03:13:55,377 INFO L226 Difference]: Without dead ends: 1769 [2024-11-12 03:13:55,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:13:55,381 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 167 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:55,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 968 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:13:55,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2024-11-12 03:13:55,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1019. [2024-11-12 03:13:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 946 states have (on average 1.4968287526427062) internal successors, (1416), 948 states have internal predecessors, (1416), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-12 03:13:55,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1552 transitions. [2024-11-12 03:13:55,445 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1552 transitions. Word has length 218 [2024-11-12 03:13:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:55,445 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1552 transitions. [2024-11-12 03:13:55,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1552 transitions. [2024-11-12 03:13:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 03:13:55,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:55,448 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:55,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 03:13:55,448 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:55,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:55,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1371424667, now seen corresponding path program 1 times [2024-11-12 03:13:55,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:55,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099527297] [2024-11-12 03:13:55,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:56,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:56,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099527297] [2024-11-12 03:13:56,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099527297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:56,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:56,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 03:13:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111953429] [2024-11-12 03:13:56,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:56,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 03:13:56,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 03:13:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:13:56,340 INFO L87 Difference]: Start difference. First operand 1019 states and 1552 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:58,289 INFO L93 Difference]: Finished difference Result 2086 states and 3111 transitions. [2024-11-12 03:13:58,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 03:13:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-11-12 03:13:58,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:58,295 INFO L225 Difference]: With dead ends: 2086 [2024-11-12 03:13:58,295 INFO L226 Difference]: Without dead ends: 1538 [2024-11-12 03:13:58,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2024-11-12 03:13:58,298 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 785 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:58,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1635 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 03:13:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-12 03:13:58,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1117. [2024-11-12 03:13:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 1028 states have (on average 1.490272373540856) internal successors, (1532), 1032 states have internal predecessors, (1532), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-12 03:13:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1696 transitions. [2024-11-12 03:13:58,379 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1696 transitions. Word has length 219 [2024-11-12 03:13:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:58,379 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1696 transitions. [2024-11-12 03:13:58,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1696 transitions. [2024-11-12 03:13:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 03:13:58,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:58,382 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:58,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 03:13:58,382 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:58,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash -804145119, now seen corresponding path program 1 times [2024-11-12 03:13:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:58,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947821664] [2024-11-12 03:13:58,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:58,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:58,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:58,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947821664] [2024-11-12 03:13:58,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947821664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:58,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:58,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 03:13:58,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4597680] [2024-11-12 03:13:58,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:58,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:13:58,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:58,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:13:58,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:13:58,652 INFO L87 Difference]: Start difference. First operand 1117 states and 1696 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:13:59,138 INFO L93 Difference]: Finished difference Result 2385 states and 3643 transitions. [2024-11-12 03:13:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 03:13:59,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-11-12 03:13:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:13:59,145 INFO L225 Difference]: With dead ends: 2385 [2024-11-12 03:13:59,146 INFO L226 Difference]: Without dead ends: 1739 [2024-11-12 03:13:59,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-12 03:13:59,148 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 310 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:13:59,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1200 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:13:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2024-11-12 03:13:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1096. [2024-11-12 03:13:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1096 states, 1007 states have (on average 1.483614697120159) internal successors, (1494), 1011 states have internal predecessors, (1494), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-12 03:13:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1658 transitions. [2024-11-12 03:13:59,233 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1658 transitions. Word has length 219 [2024-11-12 03:13:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:13:59,234 INFO L471 AbstractCegarLoop]: Abstraction has 1096 states and 1658 transitions. [2024-11-12 03:13:59,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:13:59,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1658 transitions. [2024-11-12 03:13:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 03:13:59,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:13:59,236 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:13:59,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 03:13:59,236 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:13:59,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:13:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash 993481808, now seen corresponding path program 1 times [2024-11-12 03:13:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:13:59,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810874150] [2024-11-12 03:13:59,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:13:59,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:13:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:13:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:13:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:13:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:13:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:13:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:13:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:13:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:13:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:13:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:13:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:13:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:13:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:13:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:13:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:13:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:13:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:13:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:13:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:13:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:13:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:13:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:13:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:13:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:13:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:13:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:13:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:13:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:13:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:13:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:13:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:13:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:13:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:13:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:13:59,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:13:59,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810874150] [2024-11-12 03:13:59,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810874150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:13:59,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:13:59,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 03:13:59,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309327643] [2024-11-12 03:13:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:13:59,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 03:13:59,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:13:59,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 03:13:59,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 03:13:59,813 INFO L87 Difference]: Start difference. First operand 1096 states and 1658 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:00,913 INFO L93 Difference]: Finished difference Result 2627 states and 3993 transitions. [2024-11-12 03:14:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 03:14:00,914 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-11-12 03:14:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:00,925 INFO L225 Difference]: With dead ends: 2627 [2024-11-12 03:14:00,927 INFO L226 Difference]: Without dead ends: 2002 [2024-11-12 03:14:00,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-12 03:14:00,929 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 485 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:00,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 1417 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 03:14:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2024-11-12 03:14:01,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1132. [2024-11-12 03:14:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1043 states have (on average 1.4880153403643337) internal successors, (1552), 1047 states have internal predecessors, (1552), 82 states have call successors, (82), 6 states have call predecessors, (82), 6 states have return successors, (82), 78 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-12 03:14:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1716 transitions. [2024-11-12 03:14:01,017 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1716 transitions. Word has length 219 [2024-11-12 03:14:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:01,017 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1716 transitions. [2024-11-12 03:14:01,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1716 transitions. [2024-11-12 03:14:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 03:14:01,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:01,020 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:01,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 03:14:01,020 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:01,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:01,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1713137586, now seen corresponding path program 1 times [2024-11-12 03:14:01,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:01,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563046187] [2024-11-12 03:14:01,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:01,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:14:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:14:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:14:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:14:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:14:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:14:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:14:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:14:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:14:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:14:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:14:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:14:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:14:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:14:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:14:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:14:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:14:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:14:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:14:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:14:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:14:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:14:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:14:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:14:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:14:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:14:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:14:01,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:01,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563046187] [2024-11-12 03:14:01,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563046187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:01,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:01,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 03:14:01,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779582960] [2024-11-12 03:14:01,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:01,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 03:14:01,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:01,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 03:14:01,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:14:01,878 INFO L87 Difference]: Start difference. First operand 1132 states and 1716 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:02,734 INFO L93 Difference]: Finished difference Result 3895 states and 5906 transitions. [2024-11-12 03:14:02,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 03:14:02,735 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-11-12 03:14:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:02,745 INFO L225 Difference]: With dead ends: 3895 [2024-11-12 03:14:02,745 INFO L226 Difference]: Without dead ends: 2766 [2024-11-12 03:14:02,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-11-12 03:14:02,749 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 432 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:02,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1189 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 03:14:02,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2766 states. [2024-11-12 03:14:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2766 to 2216. [2024-11-12 03:14:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 2039 states have (on average 1.4811181951937225) internal successors, (3020), 2047 states have internal predecessors, (3020), 164 states have call successors, (164), 12 states have call predecessors, (164), 12 states have return successors, (164), 156 states have call predecessors, (164), 164 states have call successors, (164) [2024-11-12 03:14:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3348 transitions. [2024-11-12 03:14:02,926 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3348 transitions. Word has length 219 [2024-11-12 03:14:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:02,927 INFO L471 AbstractCegarLoop]: Abstraction has 2216 states and 3348 transitions. [2024-11-12 03:14:02,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3348 transitions. [2024-11-12 03:14:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 03:14:02,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:02,930 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:02,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 03:14:02,930 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:02,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:02,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1744367301, now seen corresponding path program 1 times [2024-11-12 03:14:02,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:02,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909584660] [2024-11-12 03:14:02,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:02,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:14:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:14:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:14:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:14:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:14:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:14:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:14:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:14:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:14:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:14:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:14:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:14:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:14:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:14:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:14:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:14:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:14:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:14:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:14:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:14:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:14:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:14:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:14:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:14:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:14:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:14:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:14:03,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:03,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909584660] [2024-11-12 03:14:03,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909584660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:03,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:03,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:14:03,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380346745] [2024-11-12 03:14:03,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:03,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:14:03,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:03,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:14:03,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:14:03,091 INFO L87 Difference]: Start difference. First operand 2216 states and 3348 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:03,443 INFO L93 Difference]: Finished difference Result 4179 states and 6296 transitions. [2024-11-12 03:14:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:14:03,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-11-12 03:14:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:03,451 INFO L225 Difference]: With dead ends: 4179 [2024-11-12 03:14:03,451 INFO L226 Difference]: Without dead ends: 1966 [2024-11-12 03:14:03,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 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-12 03:14:03,456 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 312 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:03,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 559 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:14:03,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2024-11-12 03:14:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1864. [2024-11-12 03:14:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1645 states have (on average 1.4261398176291793) internal successors, (2346), 1653 states have internal predecessors, (2346), 204 states have call successors, (204), 14 states have call predecessors, (204), 14 states have return successors, (204), 196 states have call predecessors, (204), 204 states have call successors, (204) [2024-11-12 03:14:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2754 transitions. [2024-11-12 03:14:03,675 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2754 transitions. Word has length 219 [2024-11-12 03:14:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:03,676 INFO L471 AbstractCegarLoop]: Abstraction has 1864 states and 2754 transitions. [2024-11-12 03:14:03,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2754 transitions. [2024-11-12 03:14:03,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 03:14:03,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:03,678 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:03,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 03:14:03,678 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:03,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:03,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1083075802, now seen corresponding path program 1 times [2024-11-12 03:14:03,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:03,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10587308] [2024-11-12 03:14:03,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:03,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:14:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:14:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:14:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:14:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:14:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:14:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:14:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:14:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:14:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:14:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:14:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:14:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:14:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:14:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:14:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:14:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:14:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:14:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:14:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:14:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:14:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:14:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:14:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:14:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:14:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:14:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:14:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:04,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10587308] [2024-11-12 03:14:04,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10587308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:04,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:04,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 03:14:04,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851593566] [2024-11-12 03:14:04,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:04,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 03:14:04,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:04,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 03:14:04,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-12 03:14:04,044 INFO L87 Difference]: Start difference. First operand 1864 states and 2754 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:07,426 INFO L93 Difference]: Finished difference Result 7184 states and 10601 transitions. [2024-11-12 03:14:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 03:14:07,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-11-12 03:14:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:07,452 INFO L225 Difference]: With dead ends: 7184 [2024-11-12 03:14:07,452 INFO L226 Difference]: Without dead ends: 5323 [2024-11-12 03:14:07,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2024-11-12 03:14:07,458 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 1384 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 986 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 986 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:07,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 965 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [986 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-12 03:14:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2024-11-12 03:14:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 1872. [2024-11-12 03:14:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1653 states have (on average 1.4240774349667271) internal successors, (2354), 1661 states have internal predecessors, (2354), 204 states have call successors, (204), 14 states have call predecessors, (204), 14 states have return successors, (204), 196 states have call predecessors, (204), 204 states have call successors, (204) [2024-11-12 03:14:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2762 transitions. [2024-11-12 03:14:07,859 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2762 transitions. Word has length 219 [2024-11-12 03:14:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:07,859 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 2762 transitions. [2024-11-12 03:14:07,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2762 transitions. [2024-11-12 03:14:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 03:14:07,863 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:07,863 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:07,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 03:14:07,864 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:07,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1522947752, now seen corresponding path program 1 times [2024-11-12 03:14:07,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:07,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623227699] [2024-11-12 03:14:07,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:14:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:14:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:14:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:14:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:14:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:14:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:14:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:14:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:14:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:14:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:14:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:14:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:14:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:14:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:14:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:14:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:14:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:14:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:14:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:14:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:14:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:14:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:14:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:14:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:14:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:14:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:14:08,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:08,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623227699] [2024-11-12 03:14:08,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623227699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:08,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:08,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 03:14:08,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039303301] [2024-11-12 03:14:08,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:08,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:14:08,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:08,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:14:08,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:14:08,189 INFO L87 Difference]: Start difference. First operand 1872 states and 2762 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:08,618 INFO L93 Difference]: Finished difference Result 4455 states and 6530 transitions. [2024-11-12 03:14:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 03:14:08,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-11-12 03:14:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:08,627 INFO L225 Difference]: With dead ends: 4455 [2024-11-12 03:14:08,628 INFO L226 Difference]: Without dead ends: 2586 [2024-11-12 03:14:08,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:14:08,632 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 163 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:08,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1121 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:14:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2024-11-12 03:14:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1817. [2024-11-12 03:14:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1598 states have (on average 1.4136420525657072) internal successors, (2259), 1606 states have internal predecessors, (2259), 204 states have call successors, (204), 14 states have call predecessors, (204), 14 states have return successors, (204), 196 states have call predecessors, (204), 204 states have call successors, (204) [2024-11-12 03:14:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2667 transitions. [2024-11-12 03:14:08,879 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2667 transitions. Word has length 219 [2024-11-12 03:14:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:08,879 INFO L471 AbstractCegarLoop]: Abstraction has 1817 states and 2667 transitions. [2024-11-12 03:14:08,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2667 transitions. [2024-11-12 03:14:08,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 03:14:08,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:08,882 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:08,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 03:14:08,882 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:08,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:08,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1495207585, now seen corresponding path program 1 times [2024-11-12 03:14:08,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:08,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157210897] [2024-11-12 03:14:08,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:08,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:14:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:14:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:14:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:14:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:14:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:14:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:14:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:14:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:14:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:14:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:14:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:14:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:14:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:14:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:14:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:14:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:14:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:14:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:14:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:14:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:14:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:14:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:14:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:14:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:14:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:14:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:14:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157210897] [2024-11-12 03:14:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157210897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:09,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:09,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 03:14:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548605330] [2024-11-12 03:14:09,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:09,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:14:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:09,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:14:09,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:14:09,200 INFO L87 Difference]: Start difference. First operand 1817 states and 2667 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:10,403 INFO L93 Difference]: Finished difference Result 5240 states and 7706 transitions. [2024-11-12 03:14:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 03:14:10,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-11-12 03:14:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:10,414 INFO L225 Difference]: With dead ends: 5240 [2024-11-12 03:14:10,414 INFO L226 Difference]: Without dead ends: 3426 [2024-11-12 03:14:10,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-12 03:14:10,420 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 345 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:10,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1021 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 03:14:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2024-11-12 03:14:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 2837. [2024-11-12 03:14:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2837 states, 2418 states have (on average 1.392886683209264) internal successors, (3368), 2428 states have internal predecessors, (3368), 396 states have call successors, (396), 22 states have call predecessors, (396), 22 states have return successors, (396), 386 states have call predecessors, (396), 396 states have call successors, (396) [2024-11-12 03:14:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 4160 transitions. [2024-11-12 03:14:10,837 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 4160 transitions. Word has length 219 [2024-11-12 03:14:10,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:10,842 INFO L471 AbstractCegarLoop]: Abstraction has 2837 states and 4160 transitions. [2024-11-12 03:14:10,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 4160 transitions. [2024-11-12 03:14:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 03:14:10,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:10,844 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:10,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 03:14:10,845 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:10,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:10,845 INFO L85 PathProgramCache]: Analyzing trace with hash 586215118, now seen corresponding path program 1 times [2024-11-12 03:14:10,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:10,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639998324] [2024-11-12 03:14:10,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:10,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:14:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:14:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:14:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:14:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:14:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:14:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:14:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:14:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:14:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:14:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:14:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:14:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:14:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:14:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:14:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:14:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:14:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:14:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:14:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:14:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:14:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:14:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:14:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:14:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:14:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:14:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:14:11,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:11,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639998324] [2024-11-12 03:14:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639998324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 03:14:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515680566] [2024-11-12 03:14:11,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:11,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 03:14:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:11,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 03:14:11,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:14:11,310 INFO L87 Difference]: Start difference. First operand 2837 states and 4160 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:12,644 INFO L93 Difference]: Finished difference Result 4558 states and 6671 transitions. [2024-11-12 03:14:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 03:14:12,645 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2024-11-12 03:14:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:12,652 INFO L225 Difference]: With dead ends: 4558 [2024-11-12 03:14:12,653 INFO L226 Difference]: Without dead ends: 2736 [2024-11-12 03:14:12,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-12 03:14:12,657 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 241 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:12,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1147 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 03:14:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2024-11-12 03:14:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 2667. [2024-11-12 03:14:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 2282 states have (on average 1.3965819456617004) internal successors, (3187), 2291 states have internal predecessors, (3187), 364 states have call successors, (364), 20 states have call predecessors, (364), 20 states have return successors, (364), 355 states have call predecessors, (364), 364 states have call successors, (364) [2024-11-12 03:14:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3915 transitions. [2024-11-12 03:14:13,047 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3915 transitions. Word has length 219 [2024-11-12 03:14:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:13,048 INFO L471 AbstractCegarLoop]: Abstraction has 2667 states and 3915 transitions. [2024-11-12 03:14:13,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3915 transitions. [2024-11-12 03:14:13,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-12 03:14:13,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:13,050 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:13,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 03:14:13,050 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:13,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash -73379589, now seen corresponding path program 1 times [2024-11-12 03:14:13,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:13,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596160525] [2024-11-12 03:14:13,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:13,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:14:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:14:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:14:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:14:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:14:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:14:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:14:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:14:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:14:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:14:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:14:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:14:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:14:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:14:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:14:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:14:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:14:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:14:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:14:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:14:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:14:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:14:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:14:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:14:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:14:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:14:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:14:13,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:13,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596160525] [2024-11-12 03:14:13,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596160525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:13,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:13,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 03:14:13,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096462577] [2024-11-12 03:14:13,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:13,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 03:14:13,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:13,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 03:14:13,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:14:13,459 INFO L87 Difference]: Start difference. First operand 2667 states and 3915 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:14,349 INFO L93 Difference]: Finished difference Result 5403 states and 7938 transitions. [2024-11-12 03:14:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 03:14:14,350 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2024-11-12 03:14:14,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:14,361 INFO L225 Difference]: With dead ends: 5403 [2024-11-12 03:14:14,362 INFO L226 Difference]: Without dead ends: 4269 [2024-11-12 03:14:14,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-11-12 03:14:14,366 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 460 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:14,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1228 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 03:14:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4269 states. [2024-11-12 03:14:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4269 to 2663. [2024-11-12 03:14:14,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2278 states have (on average 1.3959613696224757) internal successors, (3180), 2287 states have internal predecessors, (3180), 364 states have call successors, (364), 20 states have call predecessors, (364), 20 states have return successors, (364), 355 states have call predecessors, (364), 364 states have call successors, (364) [2024-11-12 03:14:14,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3908 transitions. [2024-11-12 03:14:14,771 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3908 transitions. Word has length 220 [2024-11-12 03:14:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:14,771 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3908 transitions. [2024-11-12 03:14:14,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3908 transitions. [2024-11-12 03:14:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-12 03:14:14,778 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:14,778 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:14,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-12 03:14:14,778 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:14,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:14,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1094447943, now seen corresponding path program 1 times [2024-11-12 03:14:14,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:14,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893756040] [2024-11-12 03:14:14,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:14,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:14:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:14:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:14:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:14:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:14:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:14:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:14:15,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:14:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:14:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:14:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:14:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:14:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:14:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:14:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:14:15,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:14:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:14:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:14:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:14:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:14:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:14:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:14:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:14:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:14:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:14:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:14:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:14:15,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:15,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893756040] [2024-11-12 03:14:15,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893756040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:15,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:15,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 03:14:15,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723815778] [2024-11-12 03:14:15,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:15,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 03:14:15,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 03:14:15,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:14:15,216 INFO L87 Difference]: Start difference. First operand 2663 states and 3908 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:16,242 INFO L93 Difference]: Finished difference Result 5269 states and 7749 transitions. [2024-11-12 03:14:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 03:14:16,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2024-11-12 03:14:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:16,251 INFO L225 Difference]: With dead ends: 5269 [2024-11-12 03:14:16,251 INFO L226 Difference]: Without dead ends: 4139 [2024-11-12 03:14:16,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-12 03:14:16,254 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 388 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:16,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1352 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 03:14:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2024-11-12 03:14:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 2645. [2024-11-12 03:14:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2260 states have (on average 1.3924778761061947) internal successors, (3147), 2269 states have internal predecessors, (3147), 364 states have call successors, (364), 20 states have call predecessors, (364), 20 states have return successors, (364), 355 states have call predecessors, (364), 364 states have call successors, (364) [2024-11-12 03:14:16,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3875 transitions. [2024-11-12 03:14:16,643 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3875 transitions. Word has length 220 [2024-11-12 03:14:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:16,644 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 3875 transitions. [2024-11-12 03:14:16,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:16,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3875 transitions. [2024-11-12 03:14:16,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-12 03:14:16,646 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:16,646 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:16,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-12 03:14:16,647 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:16,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:16,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1079381268, now seen corresponding path program 1 times [2024-11-12 03:14:16,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:16,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486481484] [2024-11-12 03:14:16,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:16,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:14:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:14:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:14:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:14:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 03:14:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 03:14:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 03:14:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:14:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:14:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 03:14:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:14:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 03:14:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:14:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 03:14:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:14:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-12 03:14:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 03:14:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 03:14:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:14:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 03:14:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:14:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 03:14:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 03:14:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 03:14:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 03:14:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 03:14:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:14:16,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:16,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486481484] [2024-11-12 03:14:16,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486481484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:16,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:16,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:14:16,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507656521] [2024-11-12 03:14:16,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:16,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:14:16,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:16,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:14:16,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:14:16,978 INFO L87 Difference]: Start difference. First operand 2645 states and 3875 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:17,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:17,550 INFO L93 Difference]: Finished difference Result 5012 states and 7326 transitions. [2024-11-12 03:14:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:14:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2024-11-12 03:14:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:17,561 INFO L225 Difference]: With dead ends: 5012 [2024-11-12 03:14:17,561 INFO L226 Difference]: Without dead ends: 3220 [2024-11-12 03:14:17,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:14:17,566 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 127 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:17,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 576 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:14:17,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2024-11-12 03:14:18,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 2705. [2024-11-12 03:14:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2287 states have (on average 1.3878443375601224) internal successors, (3174), 2296 states have internal predecessors, (3174), 396 states have call successors, (396), 21 states have call predecessors, (396), 21 states have return successors, (396), 387 states have call predecessors, (396), 396 states have call successors, (396) [2024-11-12 03:14:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 3966 transitions. [2024-11-12 03:14:18,016 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 3966 transitions. Word has length 220 [2024-11-12 03:14:18,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:18,016 INFO L471 AbstractCegarLoop]: Abstraction has 2705 states and 3966 transitions. [2024-11-12 03:14:18,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 3966 transitions. [2024-11-12 03:14:18,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-12 03:14:18,018 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:18,018 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:18,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-12 03:14:18,018 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:18,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:18,019 INFO L85 PathProgramCache]: Analyzing trace with hash -925431521, now seen corresponding path program 1 times [2024-11-12 03:14:18,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:18,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080161989] [2024-11-12 03:14:18,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:14:18,056 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:14:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:14:18,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:14:18,179 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:14:18,180 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:14:18,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 03:14:18,188 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 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-12 03:14:18,305 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:14:18,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:14:18 BoogieIcfgContainer [2024-11-12 03:14:18,308 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:14:18,308 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:14:18,308 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:14:18,308 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:14:18,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:13:40" (3/4) ... [2024-11-12 03:14:18,311 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:14:18,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:14:18,312 INFO L158 Benchmark]: Toolchain (without parser) took 38934.96ms. Allocated memory was 165.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 108.3MB in the beginning and 1.0GB in the end (delta: -894.9MB). Peak memory consumption was 292.1MB. Max. memory is 16.1GB. [2024-11-12 03:14:18,312 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:14:18,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.25ms. Allocated memory is still 165.7MB. Free memory was 107.9MB in the beginning and 89.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 03:14:18,313 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.16ms. Allocated memory is still 165.7MB. Free memory was 89.5MB in the beginning and 84.5MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 03:14:18,313 INFO L158 Benchmark]: Boogie Preprocessor took 80.43ms. Allocated memory is still 165.7MB. Free memory was 84.5MB in the beginning and 78.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 03:14:18,314 INFO L158 Benchmark]: RCFGBuilder took 581.22ms. Allocated memory is still 165.7MB. Free memory was 78.2MB in the beginning and 45.4MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-12 03:14:18,314 INFO L158 Benchmark]: TraceAbstraction took 37870.56ms. Allocated memory was 165.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 132.1MB in the beginning and 1.0GB in the end (delta: -871.1MB). Peak memory consumption was 313.0MB. Max. memory is 16.1GB. [2024-11-12 03:14:18,315 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 1.4GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:14:18,316 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.15ms. Allocated memory is still 165.7MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.25ms. Allocated memory is still 165.7MB. Free memory was 107.9MB in the beginning and 89.9MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.16ms. Allocated memory is still 165.7MB. Free memory was 89.5MB in the beginning and 84.5MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.43ms. Allocated memory is still 165.7MB. Free memory was 84.5MB in the beginning and 78.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 581.22ms. Allocated memory is still 165.7MB. Free memory was 78.2MB in the beginning and 45.4MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 37870.56ms. Allocated memory was 165.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 132.1MB in the beginning and 1.0GB in the end (delta: -871.1MB). Peak memory consumption was 313.0MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 1.4GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 206, overapproximation of someBinaryFLOATComparisonOperation at line 206, overapproximation of someUnaryDOUBLEoperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] unsigned char var_1_38 = 8; [L45] unsigned char var_1_39 = 10; [L46] double var_1_40 = 8.35; [L47] double var_1_41 = 63.75; [L48] double var_1_42 = -0.125; [L49] double var_1_43 = -0.8; [L50] double var_1_44 = -0.5; [L51] unsigned short int var_1_45 = 50; [L52] unsigned char var_1_46 = 0; [L53] unsigned char var_1_47 = 5; [L54] unsigned char var_1_48 = 1; [L55] signed char var_1_49 = -16; [L56] signed char var_1_50 = 2; [L57] signed char var_1_51 = 16; [L58] signed char var_1_52 = 0; [L59] signed long int var_1_53 = 256; [L60] double var_1_54 = 1.25; [L61] unsigned long int var_1_55 = 5; [L62] signed long int last_1_var_1_1 = 64; [L63] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L210] isInitial = 1 [L211] FCALL initially() [L212] COND TRUE 1 [L213] CALL updateLastVariables() [L202] last_1_var_1_1 = var_1_1 [L203] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L213] RET updateLastVariables() [L214] CALL updateVariables() [L147] var_1_7 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L148] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L149] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] var_1_15 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_16 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] var_1_18 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] var_1_19 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] var_1_20 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] var_1_21 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_22 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] var_1_23 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] var_1_27 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] var_1_28 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] var_1_38 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] CALL assume_abort_if_not(var_1_39 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] RET assume_abort_if_not(var_1_39 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L180] var_1_41 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L181] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L182] var_1_42 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L183] RET assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L184] var_1_43 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L185] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] var_1_44 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L187] RET assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L188] var_1_47 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L191] var_1_50 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L192] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L194] var_1_51 = __VERIFIER_nondet_char() [L195] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L195] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L197] var_1_52 = __VERIFIER_nondet_char() [L198] CALL assume_abort_if_not(var_1_52 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L198] RET assume_abort_if_not(var_1_52 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] CALL assume_abort_if_not(var_1_52 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] RET assume_abort_if_not(var_1_52 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L214] RET updateVariables() [L215] CALL step() [L67] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L68] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L71] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L72] COND FALSE !(\read(var_1_7)) [L75] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L77] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L80] var_1_32 = var_1_16 [L81] var_1_30 = var_1_32 [L82] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L83] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L83] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L84] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L86] COND TRUE var_1_11 >= var_1_30 [L87] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L89] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L89] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L90] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L98] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=10, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L99] COND TRUE ! var_1_7 [L100] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] EXPR var_1_1 ^ var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] EXPR var_1_13 | var_1_31 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L108] COND TRUE (var_1_1 ^ var_1_32) < (var_1_13 | var_1_31) [L109] var_1_33 = ((((var_1_38) > (var_1_39)) ? (var_1_38) : (var_1_39))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L113] COND TRUE (-32 & var_1_38) > var_1_31 [L114] var_1_40 = ((((var_1_41) > (var_1_42)) ? (var_1_41) : (var_1_42))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L118] COND FALSE !(var_1_44 >= ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L125] COND TRUE var_1_44 <= (var_1_29 + var_1_43) [L126] var_1_45 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L129] COND FALSE !(var_1_44 > (var_1_43 + var_1_41)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L136] var_1_48 = var_1_39 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=-2, var_1_49=-16, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L137] COND FALSE !(var_1_41 < var_1_29) [L140] var_1_49 = ((((((((var_1_50) < (var_1_51)) ? (var_1_50) : (var_1_51)))) > (var_1_52)) ? (((((var_1_50) < (var_1_51)) ? (var_1_50) : (var_1_51)))) : (var_1_52))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=-2, var_1_49=4, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L142] var_1_53 = var_1_32 [L143] var_1_54 = var_1_44 [L144] var_1_55 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=-2, var_1_49=4, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L215] RET step() [L216] CALL, EXPR property() [L206] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=-2, var_1_49=4, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=-2, var_1_49=4, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=-2, var_1_49=4, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=-2, var_1_49=4, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L206-L207] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=-2, var_1_49=4, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=0, var_1_22=507, var_1_24=-64, var_1_26=0, var_1_27=-63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=505, var_1_41=505, var_1_42=505, var_1_44=506, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=-2, var_1_49=4, var_1_50=4, var_1_51=4, var_1_52=4, var_1_53=0, var_1_54=506, var_1_55=64, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.7s, OverallIterations: 28, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9898 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9898 mSDsluCounter, 24583 SdHoareTripleChecker+Invalid, 10.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17666 mSDsCounter, 2433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12399 IncrementalHoareTripleChecker+Invalid, 14832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2433 mSolverCounterUnsat, 6917 mSDtfsCounter, 12399 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2088 GetRequests, 1869 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2837occurred in iteration=23, InterpolantAutomatonStates: 199, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 15079 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 6106 NumberOfCodeBlocks, 6106 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 5859 ConstructedInterpolants, 0 QuantifiedInterpolants, 20651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 53568/53568 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-12 03:14:18,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.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 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:14:20,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:14:20,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:14:20,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:14:20,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:14:20,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:14:20,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:14:20,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:14:20,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:14:20,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:14:20,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:14:20,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:14:20,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:14:20,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:14:20,533 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:14:20,533 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:14:20,533 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:14:20,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:14:20,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:14:20,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:14:20,534 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:14:20,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:14:20,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:14:20,535 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:14:20,535 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:14:20,536 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:14:20,536 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:14:20,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:14:20,536 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:14:20,536 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:14:20,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:14:20,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:14:20,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:14:20,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:14:20,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:14:20,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:14:20,538 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:14:20,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:14:20,539 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:14:20,539 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:14:20,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:14:20,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:14:20,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:14:20,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:14:20,540 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 -> 2b25a2230e8cd5e14dc98a853cb32c06f85de9122996251da70e4b6160e146c4 [2024-11-12 03:14:20,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:14:20,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:14:20,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:14:20,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:14:20,880 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:14:20,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-11-12 03:14:22,320 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:14:22,539 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:14:22,541 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-11-12 03:14:22,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd63aea4/d137ce3d9bc74c49882a1734bbc4790e/FLAG8a03ec452 [2024-11-12 03:14:22,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd63aea4/d137ce3d9bc74c49882a1734bbc4790e [2024-11-12 03:14:22,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:14:22,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:14:22,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:14:22,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:14:22,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:14:22,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:22,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eda871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22, skipping insertion in model container [2024-11-12 03:14:22,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:22,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:14:22,784 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-co_file-63.i[919,932] [2024-11-12 03:14:22,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:14:22,889 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:14:22,902 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-co_file-63.i[919,932] [2024-11-12 03:14:22,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:14:22,982 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:14:22,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22 WrapperNode [2024-11-12 03:14:22,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:14:22,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:14:22,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:14:22,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:14:22,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,040 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-11-12 03:14:23,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:14:23,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:14:23,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:14:23,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:14:23,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,081 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-12 03:14:23,083 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,083 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,124 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:14:23,125 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:14:23,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:14:23,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:14:23,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (1/1) ... [2024-11-12 03:14:23,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:14:23,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:14:23,159 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-12 03:14:23,162 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-12 03:14:23,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:14:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:14:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:14:23,204 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:14:23,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:14:23,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:14:23,293 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:14:23,294 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:14:31,577 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 03:14:31,577 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:14:31,590 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:14:31,590 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:14:31,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:14:31 BoogieIcfgContainer [2024-11-12 03:14:31,590 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:14:31,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:14:31,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:14:31,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:14:31,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:14:22" (1/3) ... [2024-11-12 03:14:31,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc1f9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:14:31, skipping insertion in model container [2024-11-12 03:14:31,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:22" (2/3) ... [2024-11-12 03:14:31,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc1f9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:14:31, skipping insertion in model container [2024-11-12 03:14:31,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:14:31" (3/3) ... [2024-11-12 03:14:31,596 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-63.i [2024-11-12 03:14:31,608 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:14:31,609 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:14:31,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:14:31,662 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;@47761fd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:14:31,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:14:31,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 61 states have internal predecessors, (83), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 03:14:31,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 03:14:31,677 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:31,677 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:31,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:31,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1369349182, now seen corresponding path program 1 times [2024-11-12 03:14:31,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:14:31,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755932463] [2024-11-12 03:14:31,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:31,693 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-12 03:14:31,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:14:31,694 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-12 03:14:31,951 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-12 03:14:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:14:32,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:14:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2024-11-12 03:14:32,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:14:32,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:14:32,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755932463] [2024-11-12 03:14:32,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755932463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:32,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:32,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:14:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921469537] [2024-11-12 03:14:32,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:32,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:14:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:14:32,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:14:32,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:14:32,619 INFO L87 Difference]: Start difference. First operand has 95 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 61 states have internal predecessors, (83), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-12 03:14:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:32,652 INFO L93 Difference]: Finished difference Result 183 states and 320 transitions. [2024-11-12 03:14:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:14:32,655 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 208 [2024-11-12 03:14:32,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:32,662 INFO L225 Difference]: With dead ends: 183 [2024-11-12 03:14:32,662 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 03:14:32,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 207 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-12 03:14:32,672 INFO L435 NwaCegarLoop]: 140 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, 140 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-12 03:14:32,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:14:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 03:14:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-12 03:14:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-12 03:14:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2024-11-12 03:14:32,722 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 208 [2024-11-12 03:14:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:32,723 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2024-11-12 03:14:32,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-12 03:14:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2024-11-12 03:14:32,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 03:14:32,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:32,729 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:32,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 03:14:32,933 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-12 03:14:32,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:32,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:32,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1642921070, now seen corresponding path program 1 times [2024-11-12 03:14:32,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:14:32,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305024968] [2024-11-12 03:14:32,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:32,937 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-12 03:14:32,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:14:32,940 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-12 03:14:32,941 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-12 03:14:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:33,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 03:14:33,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:14:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:14:36,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:14:36,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:14:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305024968] [2024-11-12 03:14:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305024968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:36,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:36,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:14:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544797568] [2024-11-12 03:14:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:36,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:14:36,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:14:36,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:14:36,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:14:36,090 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:39,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:14:41,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:14:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:41,140 INFO L93 Difference]: Finished difference Result 268 states and 415 transitions. [2024-11-12 03:14:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:14:41,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-11-12 03:14:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:41,171 INFO L225 Difference]: With dead ends: 268 [2024-11-12 03:14:41,171 INFO L226 Difference]: Without dead ends: 180 [2024-11-12 03:14:41,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:14:41,172 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 87 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:41,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 455 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-12 03:14:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-12 03:14:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2024-11-12 03:14:41,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 03:14:41,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 231 transitions. [2024-11-12 03:14:41,201 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 231 transitions. Word has length 208 [2024-11-12 03:14:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:41,202 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 231 transitions. [2024-11-12 03:14:41,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 231 transitions. [2024-11-12 03:14:41,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 03:14:41,208 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:41,208 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:41,228 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-12 03:14:41,408 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-12 03:14:41,409 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:41,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:41,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1861775788, now seen corresponding path program 1 times [2024-11-12 03:14:41,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:14:41,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663677539] [2024-11-12 03:14:41,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:41,411 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-12 03:14:41,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:14:41,412 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-12 03:14:41,413 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-12 03:14:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:41,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 03:14:41,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:14:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 03:14:41,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:14:41,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:14:41,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663677539] [2024-11-12 03:14:41,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663677539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:41,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:41,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:14:41,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323699750] [2024-11-12 03:14:41,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:41,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:14:41,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:14:41,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:14:41,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:14:41,962 INFO L87 Difference]: Start difference. First operand 151 states and 231 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:45,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:14:48,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 03:14:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:48,657 INFO L93 Difference]: Finished difference Result 266 states and 410 transitions. [2024-11-12 03:14:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:14:48,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-11-12 03:14:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:48,690 INFO L225 Difference]: With dead ends: 266 [2024-11-12 03:14:48,690 INFO L226 Difference]: Without dead ends: 178 [2024-11-12 03:14:48,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 206 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-12 03:14:48,692 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 40 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:48,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 261 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-12 03:14:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-12 03:14:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 159. [2024-11-12 03:14:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 92 states have internal predecessors, (114), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-12 03:14:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 242 transitions. [2024-11-12 03:14:48,721 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 242 transitions. Word has length 208 [2024-11-12 03:14:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:48,722 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 242 transitions. [2024-11-12 03:14:48,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-12 03:14:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 242 transitions. [2024-11-12 03:14:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 03:14:48,726 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:48,727 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:48,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 03:14:48,927 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-12 03:14:48,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:48,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash 172832046, now seen corresponding path program 1 times [2024-11-12 03:14:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:14:48,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337078905] [2024-11-12 03:14:48,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:48,929 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-12 03:14:48,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:14:48,935 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-12 03:14:48,936 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-12 03:14:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:49,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 03:14:49,428 INFO L279 TraceCheckSpWp]: Computing forward predicates...