./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.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 e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:45:28,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:45:28,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:45:28,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:45:28,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:45:28,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:45:28,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:45:28,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:45:28,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:45:28,362 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:45:28,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:45:28,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:45:28,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:45:28,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:45:28,366 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:45:28,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:45:28,367 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:45:28,367 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:45:28,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:45:28,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:45:28,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:45:28,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:45:28,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:45:28,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:45:28,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:45:28,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:45:28,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:45:28,370 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:45:28,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:45:28,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:45:28,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:45:28,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:45:28,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:45:28,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:45:28,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:45:28,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:45:28,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:45:28,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:45:28,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:45:28,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:45:28,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:45:28,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:45:28,376 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 -> e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e [2024-11-08 20:45:28,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:45:28,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:45:28,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:45:28,681 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:45:28,681 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:45:28,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-08 20:45:30,095 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:45:30,302 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:45:30,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-08 20:45:30,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cebcccbf/b2074d77945c4267a86542c70b394573/FLAG27e443e2a [2024-11-08 20:45:30,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cebcccbf/b2074d77945c4267a86542c70b394573 [2024-11-08 20:45:30,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:45:30,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:45:30,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:45:30,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:45:30,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:45:30,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,338 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@733d55ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30, skipping insertion in model container [2024-11-08 20:45:30,338 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:45:30,553 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_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-08 20:45:30,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:45:30,651 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:45:30,660 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_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-08 20:45:30,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:45:30,714 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:45:30,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30 WrapperNode [2024-11-08 20:45:30,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:45:30,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:45:30,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:45:30,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:45:30,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,790 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2024-11-08 20:45:30,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:45:30,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:45:30,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:45:30,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:45:30,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,822 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:45:30,822 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:45:30,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:45:30,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:45:30,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:45:30,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (1/1) ... [2024-11-08 20:45:30,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:45:30,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:45:30,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:45:30,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:45:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:45:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:45:30,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:45:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:45:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:45:30,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:45:31,018 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:45:31,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:45:31,457 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-08 20:45:31,457 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:45:31,474 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:45:31,474 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:45:31,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:45:31 BoogieIcfgContainer [2024-11-08 20:45:31,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:45:31,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:45:31,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:45:31,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:45:31,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:45:30" (1/3) ... [2024-11-08 20:45:31,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be6cd72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:45:31, skipping insertion in model container [2024-11-08 20:45:31,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:45:30" (2/3) ... [2024-11-08 20:45:31,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be6cd72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:45:31, skipping insertion in model container [2024-11-08 20:45:31,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:45:31" (3/3) ... [2024-11-08 20:45:31,484 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-08 20:45:31,498 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:45:31,498 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:45:31,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:45:31,571 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;@df5fbc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:45:31,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:45:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:45:31,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 20:45:31,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:31,593 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:31,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:31,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:31,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1782693715, now seen corresponding path program 1 times [2024-11-08 20:45:31,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:31,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184971646] [2024-11-08 20:45:31,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:31,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:31,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:45:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:31,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:45:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:45:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:31,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:45:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:45:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:45:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:45:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:45:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:45:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:45:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:45:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:45:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:45:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:45:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:45:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:45:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:45:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:45:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:45:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:45:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:45:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:45:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:45:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:45:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:45:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:45:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:45:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:45:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:45:32,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:32,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184971646] [2024-11-08 20:45:32,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184971646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:45:32,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:45:32,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:45:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328079803] [2024-11-08 20:45:32,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:45:32,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:45:32,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:32,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:45:32,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:45:32,259 INFO L87 Difference]: Start difference. First operand has 109 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:45:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:45:32,307 INFO L93 Difference]: Finished difference Result 211 states and 358 transitions. [2024-11-08 20:45:32,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:45:32,309 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-08 20:45:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:45:32,319 INFO L225 Difference]: With dead ends: 211 [2024-11-08 20:45:32,320 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 20:45:32,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:45:32,327 INFO L432 NwaCegarLoop]: 161 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, 161 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:45:32,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:45:32,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 20:45:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-08 20:45:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:45:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 161 transitions. [2024-11-08 20:45:32,395 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 161 transitions. Word has length 186 [2024-11-08 20:45:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:45:32,397 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 161 transitions. [2024-11-08 20:45:32,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:45:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 161 transitions. [2024-11-08 20:45:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 20:45:32,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:32,405 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:32,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:45:32,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash 551637579, now seen corresponding path program 1 times [2024-11-08 20:45:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:32,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573116303] [2024-11-08 20:45:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:45:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:45:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:45:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:45:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:45:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:45:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:45:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:45:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:45:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:45:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:45:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:45:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:45:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:45:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:45:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:45:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:45:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:45:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:45:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:45:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:45:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:45:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:45:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:45:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:45:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:45:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:45:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:45:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:45:32,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:32,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573116303] [2024-11-08 20:45:32,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573116303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:45:32,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:45:32,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:45:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142487734] [2024-11-08 20:45:32,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:45:32,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:45:32,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:32,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:45:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:45:32,831 INFO L87 Difference]: Start difference. First operand 105 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:32,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:45:32,871 INFO L93 Difference]: Finished difference Result 208 states and 321 transitions. [2024-11-08 20:45:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:45:32,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-08 20:45:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:45:32,878 INFO L225 Difference]: With dead ends: 208 [2024-11-08 20:45:32,879 INFO L226 Difference]: Without dead ends: 106 [2024-11-08 20:45:32,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:45:32,883 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:45:32,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:45:32,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-08 20:45:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-08 20:45:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:45:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 162 transitions. [2024-11-08 20:45:32,901 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 162 transitions. Word has length 186 [2024-11-08 20:45:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:45:32,903 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 162 transitions. [2024-11-08 20:45:32,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 162 transitions. [2024-11-08 20:45:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 20:45:32,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:32,910 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:32,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:45:32,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:32,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:32,912 INFO L85 PathProgramCache]: Analyzing trace with hash -16239608, now seen corresponding path program 1 times [2024-11-08 20:45:32,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:32,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246851947] [2024-11-08 20:45:32,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:32,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:45:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:45:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:45:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:45:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:45:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:45:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:45:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:45:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:45:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:45:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:45:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:45:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:45:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:45:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:45:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:45:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:45:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:45:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:45:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:45:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:45:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:45:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:45:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:45:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:45:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:45:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:45:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:45:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:45:36,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:36,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246851947] [2024-11-08 20:45:36,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246851947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:45:36,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:45:36,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 20:45:36,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501151529] [2024-11-08 20:45:36,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:45:36,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 20:45:36,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:36,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 20:45:36,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:45:36,758 INFO L87 Difference]: Start difference. First operand 106 states and 162 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:45:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:45:39,201 INFO L93 Difference]: Finished difference Result 323 states and 481 transitions. [2024-11-08 20:45:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 20:45:39,202 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 187 [2024-11-08 20:45:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:45:39,205 INFO L225 Difference]: With dead ends: 323 [2024-11-08 20:45:39,208 INFO L226 Difference]: Without dead ends: 220 [2024-11-08 20:45:39,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-08 20:45:39,210 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 706 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:45:39,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 511 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 20:45:39,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-08 20:45:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 136. [2024-11-08 20:45:39,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 105 states have internal predecessors, (149), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:45:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 205 transitions. [2024-11-08 20:45:39,242 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 205 transitions. Word has length 187 [2024-11-08 20:45:39,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:45:39,242 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 205 transitions. [2024-11-08 20:45:39,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:45:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 205 transitions. [2024-11-08 20:45:39,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 20:45:39,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:39,248 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:39,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:45:39,249 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:39,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1037307962, now seen corresponding path program 1 times [2024-11-08 20:45:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211423337] [2024-11-08 20:45:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:39,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:45:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:45:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:45:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:45:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:45:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:45:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:45:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:45:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:45:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:45:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:45:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:45:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:45:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:45:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:45:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:45:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:45:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:45:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:45:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:45:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:45:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:45:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:45:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:45:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:45:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:45:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:45:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:45:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:45:41,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:41,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211423337] [2024-11-08 20:45:41,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211423337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:45:41,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:45:41,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 20:45:41,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830185122] [2024-11-08 20:45:41,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:45:41,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 20:45:41,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:41,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 20:45:41,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:45:41,268 INFO L87 Difference]: Start difference. First operand 136 states and 205 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:45:41,635 INFO L93 Difference]: Finished difference Result 309 states and 464 transitions. [2024-11-08 20:45:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 20:45:41,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-08 20:45:41,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:45:41,638 INFO L225 Difference]: With dead ends: 309 [2024-11-08 20:45:41,639 INFO L226 Difference]: Without dead ends: 176 [2024-11-08 20:45:41,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:45:41,644 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 93 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:45:41,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 775 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:45:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-08 20:45:41,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 134. [2024-11-08 20:45:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:45:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 202 transitions. [2024-11-08 20:45:41,660 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 202 transitions. Word has length 187 [2024-11-08 20:45:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:45:41,661 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 202 transitions. [2024-11-08 20:45:41,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 202 transitions. [2024-11-08 20:45:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 20:45:41,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:41,663 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:41,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:45:41,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:41,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:41,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1705183350, now seen corresponding path program 1 times [2024-11-08 20:45:41,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:41,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240075096] [2024-11-08 20:45:41,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:41,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:45:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:45:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:45:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:45:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:45:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:45:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:45:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:45:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:45:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:45:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:45:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:45:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:45:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:45:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:45:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:45:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:45:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:45:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:45:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:45:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:45:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:45:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:45:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:45:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:45:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:45:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:45:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:45:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:45:44,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:44,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240075096] [2024-11-08 20:45:44,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240075096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:45:44,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:45:44,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 20:45:44,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365317471] [2024-11-08 20:45:44,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:45:44,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 20:45:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:44,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 20:45:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:45:44,844 INFO L87 Difference]: Start difference. First operand 134 states and 202 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:45:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:45:47,558 INFO L93 Difference]: Finished difference Result 377 states and 560 transitions. [2024-11-08 20:45:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 20:45:47,559 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 187 [2024-11-08 20:45:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:45:47,562 INFO L225 Difference]: With dead ends: 377 [2024-11-08 20:45:47,562 INFO L226 Difference]: Without dead ends: 246 [2024-11-08 20:45:47,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-08 20:45:47,564 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 450 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 20:45:47,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 512 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 20:45:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-08 20:45:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 141. [2024-11-08 20:45:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 110 states have internal predecessors, (157), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:45:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2024-11-08 20:45:47,591 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 187 [2024-11-08 20:45:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:45:47,593 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2024-11-08 20:45:47,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:45:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2024-11-08 20:45:47,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-08 20:45:47,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:47,596 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:47,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:45:47,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:47,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:47,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1568715592, now seen corresponding path program 1 times [2024-11-08 20:45:47,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:47,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394576561] [2024-11-08 20:45:47,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:47,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:45:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:45:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:45:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:45:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:45:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:45:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:45:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:45:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:45:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:45:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:45:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:45:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:45:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:45:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:45:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:45:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:45:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:45:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:45:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:45:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:45:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:45:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:45:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:45:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:45:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:45:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:45:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:45:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:45:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394576561] [2024-11-08 20:45:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394576561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:45:49,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:45:49,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 20:45:49,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175040698] [2024-11-08 20:45:49,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:45:49,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 20:45:49,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:49,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 20:45:49,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:45:49,195 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:45:49,758 INFO L93 Difference]: Finished difference Result 316 states and 474 transitions. [2024-11-08 20:45:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 20:45:49,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-08 20:45:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:45:49,761 INFO L225 Difference]: With dead ends: 316 [2024-11-08 20:45:49,761 INFO L226 Difference]: Without dead ends: 178 [2024-11-08 20:45:49,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:45:49,763 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 134 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:45:49,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 731 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 20:45:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-08 20:45:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 112. [2024-11-08 20:45:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:45:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2024-11-08 20:45:49,779 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 187 [2024-11-08 20:45:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:45:49,779 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-11-08 20:45:49,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2024-11-08 20:45:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 20:45:49,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:49,782 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:49,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 20:45:49,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:49,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:49,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1025154531, now seen corresponding path program 1 times [2024-11-08 20:45:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864064386] [2024-11-08 20:45:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:45:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:45:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:45:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:45:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:45:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:45:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:45:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:45:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:45:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:45:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:49,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:45:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:45:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:45:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:45:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:45:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:45:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:45:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:45:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:45:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:45:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:45:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:45:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:45:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:45:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:45:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:45:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:45:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:45:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 20:45:50,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:50,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864064386] [2024-11-08 20:45:50,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864064386] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:45:50,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128707745] [2024-11-08 20:45:50,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:50,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:45:50,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:45:50,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:45:50,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 20:45:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:50,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 20:45:50,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:45:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 395 proven. 81 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-11-08 20:45:50,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:45:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 20:45:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128707745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:45:50,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 20:45:50,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-08 20:45:50,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183125616] [2024-11-08 20:45:50,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 20:45:50,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 20:45:50,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:50,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 20:45:50,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:45:50,945 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 6 states have call successors, (82), 3 states have call predecessors, (82), 5 states have return successors, (83), 5 states have call predecessors, (83), 6 states have call successors, (83) [2024-11-08 20:45:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:45:51,207 INFO L93 Difference]: Finished difference Result 227 states and 336 transitions. [2024-11-08 20:45:51,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 20:45:51,208 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 6 states have call successors, (82), 3 states have call predecessors, (82), 5 states have return successors, (83), 5 states have call predecessors, (83), 6 states have call successors, (83) Word has length 189 [2024-11-08 20:45:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:45:51,210 INFO L225 Difference]: With dead ends: 227 [2024-11-08 20:45:51,210 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 20:45:51,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-08 20:45:51,211 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 220 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:45:51,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 291 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:45:51,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 20:45:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-11-08 20:45:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:45:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2024-11-08 20:45:51,229 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 189 [2024-11-08 20:45:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:45:51,231 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2024-11-08 20:45:51,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 6 states have call successors, (82), 3 states have call predecessors, (82), 5 states have return successors, (83), 5 states have call predecessors, (83), 6 states have call successors, (83) [2024-11-08 20:45:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2024-11-08 20:45:51,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 20:45:51,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:51,236 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:51,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 20:45:51,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:45:51,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:51,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash -968990175, now seen corresponding path program 1 times [2024-11-08 20:45:51,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:51,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618279633] [2024-11-08 20:45:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:45:51,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097590554] [2024-11-08 20:45:51,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:51,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:45:51,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:45:51,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:45:51,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 20:45:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:51,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 20:45:51,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:45:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-11-08 20:45:51,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:45:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 12 proven. 69 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 20:45:52,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618279633] [2024-11-08 20:45:52,244 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 20:45:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097590554] [2024-11-08 20:45:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097590554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:45:52,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:45:52,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-08 20:45:52,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318229626] [2024-11-08 20:45:52,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:45:52,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 20:45:52,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:52,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 20:45:52,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-08 20:45:52,247 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 3 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 3 states have call predecessors, (52), 3 states have call successors, (52) [2024-11-08 20:45:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:45:53,087 INFO L93 Difference]: Finished difference Result 321 states and 448 transitions. [2024-11-08 20:45:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 20:45:53,088 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 3 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 3 states have call predecessors, (52), 3 states have call successors, (52) Word has length 189 [2024-11-08 20:45:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:45:53,090 INFO L225 Difference]: With dead ends: 321 [2024-11-08 20:45:53,090 INFO L226 Difference]: Without dead ends: 208 [2024-11-08 20:45:53,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-08 20:45:53,092 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 312 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 20:45:53,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 967 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 20:45:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-08 20:45:53,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 155. [2024-11-08 20:45:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 122 states have internal predecessors, (165), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:45:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 221 transitions. [2024-11-08 20:45:53,105 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 221 transitions. Word has length 189 [2024-11-08 20:45:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:45:53,105 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 221 transitions. [2024-11-08 20:45:53,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 3 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 3 states have call predecessors, (52), 3 states have call successors, (52) [2024-11-08 20:45:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 221 transitions. [2024-11-08 20:45:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 20:45:53,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:53,107 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:53,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 20:45:53,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 20:45:53,308 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:53,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:53,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1399968200, now seen corresponding path program 1 times [2024-11-08 20:45:53,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:53,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896628143] [2024-11-08 20:45:53,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:53,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:45:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:45:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:45:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:45:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:45:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:45:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:45:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:45:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:45:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:45:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:45:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:45:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:45:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:45:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:45:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:45:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:45:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:45:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:45:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:45:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:45:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:45:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:45:53,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:45:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:45:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:45:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:45:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:45:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:45:53,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:53,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896628143] [2024-11-08 20:45:53,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896628143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:45:53,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:45:53,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:45:53,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191636640] [2024-11-08 20:45:53,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:45:53,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:45:53,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:45:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:45:53,414 INFO L87 Difference]: Start difference. First operand 155 states and 221 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:53,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:45:53,576 INFO L93 Difference]: Finished difference Result 393 states and 562 transitions. [2024-11-08 20:45:53,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:45:53,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-08 20:45:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:45:53,579 INFO L225 Difference]: With dead ends: 393 [2024-11-08 20:45:53,579 INFO L226 Difference]: Without dead ends: 241 [2024-11-08 20:45:53,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:45:53,580 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 141 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:45:53,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 310 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:45:53,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-08 20:45:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 155. [2024-11-08 20:45:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:45:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 220 transitions. [2024-11-08 20:45:53,596 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 220 transitions. Word has length 189 [2024-11-08 20:45:53,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:45:53,597 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 220 transitions. [2024-11-08 20:45:53,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 220 transitions. [2024-11-08 20:45:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 20:45:53,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:53,598 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:53,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 20:45:53,599 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:53,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:53,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1098202920, now seen corresponding path program 1 times [2024-11-08 20:45:53,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:53,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824977777] [2024-11-08 20:45:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:53,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:45:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:45:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:45:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:45:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:45:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:45:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:45:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:45:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:45:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:45:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:45:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:45:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:45:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:45:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:45:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:45:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:45:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:45:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:45:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:45:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:45:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:45:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:45:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:45:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:45:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:45:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:45:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:45:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:45:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:54,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824977777] [2024-11-08 20:45:54,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824977777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:45:54,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:45:54,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 20:45:54,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816075873] [2024-11-08 20:45:54,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:45:54,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 20:45:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:54,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 20:45:54,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:45:54,395 INFO L87 Difference]: Start difference. First operand 155 states and 220 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:45:54,891 INFO L93 Difference]: Finished difference Result 549 states and 749 transitions. [2024-11-08 20:45:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 20:45:54,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-08 20:45:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:45:54,894 INFO L225 Difference]: With dead ends: 549 [2024-11-08 20:45:54,894 INFO L226 Difference]: Without dead ends: 397 [2024-11-08 20:45:54,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:45:54,896 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 191 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:45:54,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 729 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 20:45:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-08 20:45:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 274. [2024-11-08 20:45:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 226 states have (on average 1.3407079646017699) internal successors, (303), 227 states have internal predecessors, (303), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:45:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 381 transitions. [2024-11-08 20:45:54,930 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 381 transitions. Word has length 189 [2024-11-08 20:45:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:45:54,930 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 381 transitions. [2024-11-08 20:45:54,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 381 transitions. [2024-11-08 20:45:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-08 20:45:54,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:54,933 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:54,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 20:45:54,933 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:54,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:54,934 INFO L85 PathProgramCache]: Analyzing trace with hash -675501094, now seen corresponding path program 1 times [2024-11-08 20:45:54,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:54,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519293850] [2024-11-08 20:45:54,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:54,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:45:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:45:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:45:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:45:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:45:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:45:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:45:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:45:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:45:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:45:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:45:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:45:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:45:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:45:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:45:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:45:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:45:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:45:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:45:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:45:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:45:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:45:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:45:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:45:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:45:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:45:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:45:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:45:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:45:55,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:55,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519293850] [2024-11-08 20:45:55,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519293850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:45:55,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:45:55,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 20:45:55,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267890303] [2024-11-08 20:45:55,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:45:55,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 20:45:55,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:55,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 20:45:55,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:45:55,421 INFO L87 Difference]: Start difference. First operand 274 states and 381 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:45:55,843 INFO L93 Difference]: Finished difference Result 800 states and 1093 transitions. [2024-11-08 20:45:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 20:45:55,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-08 20:45:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:45:55,849 INFO L225 Difference]: With dead ends: 800 [2024-11-08 20:45:55,851 INFO L226 Difference]: Without dead ends: 529 [2024-11-08 20:45:55,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:45:55,852 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 171 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:45:55,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 908 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 20:45:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-08 20:45:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 281. [2024-11-08 20:45:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 233 states have (on average 1.3433476394849786) internal successors, (313), 234 states have internal predecessors, (313), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:45:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 391 transitions. [2024-11-08 20:45:55,884 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 391 transitions. Word has length 189 [2024-11-08 20:45:55,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:45:55,885 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 391 transitions. [2024-11-08 20:45:55,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:45:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 391 transitions. [2024-11-08 20:45:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 20:45:55,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:45:55,887 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:45:55,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 20:45:55,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:45:55,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:45:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash 29296591, now seen corresponding path program 1 times [2024-11-08 20:45:55,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:45:55,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139643477] [2024-11-08 20:45:55,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:45:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:45:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:45:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:45:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:45:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:45:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:45:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:45:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:45:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:45:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:45:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:45:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:45:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:45:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:45:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:45:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:45:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:45:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:45:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:45:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:45:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:45:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:45:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:45:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:45:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:45:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:45:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:45:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:45:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:45:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:45:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:45:58,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:45:58,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139643477] [2024-11-08 20:45:58,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139643477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:45:58,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:45:58,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 20:45:58,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019664243] [2024-11-08 20:45:58,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:45:58,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 20:45:58,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:45:58,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 20:45:58,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 20:45:58,371 INFO L87 Difference]: Start difference. First operand 281 states and 391 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:46:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:46:00,254 INFO L93 Difference]: Finished difference Result 794 states and 1093 transitions. [2024-11-08 20:46:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 20:46:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-08 20:46:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:46:00,259 INFO L225 Difference]: With dead ends: 794 [2024-11-08 20:46:00,259 INFO L226 Difference]: Without dead ends: 516 [2024-11-08 20:46:00,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-08 20:46:00,261 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 408 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:46:00,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1509 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 20:46:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-08 20:46:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 341. [2024-11-08 20:46:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 293 states have (on average 1.348122866894198) internal successors, (395), 294 states have internal predecessors, (395), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:46:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 473 transitions. [2024-11-08 20:46:00,291 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 473 transitions. Word has length 190 [2024-11-08 20:46:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:46:00,293 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 473 transitions. [2024-11-08 20:46:00,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:46:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 473 transitions. [2024-11-08 20:46:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 20:46:00,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:46:00,296 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:46:00,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 20:46:00,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:46:00,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:46:00,296 INFO L85 PathProgramCache]: Analyzing trace with hash 331061871, now seen corresponding path program 1 times [2024-11-08 20:46:00,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:46:00,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730665278] [2024-11-08 20:46:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:46:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:46:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:46:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:46:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:46:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:46:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:46:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:46:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:46:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:46:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:46:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:46:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:46:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:46:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:46:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:46:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:46:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:46:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:46:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:46:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:46:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:46:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:46:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:46:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:46:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:46:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:46:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:46:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:46:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:46:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:46:01,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:46:01,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730665278] [2024-11-08 20:46:01,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730665278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:46:01,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:46:01,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 20:46:01,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288001271] [2024-11-08 20:46:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:46:01,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 20:46:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:46:01,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 20:46:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:46:01,083 INFO L87 Difference]: Start difference. First operand 341 states and 473 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:46:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:46:02,063 INFO L93 Difference]: Finished difference Result 975 states and 1337 transitions. [2024-11-08 20:46:02,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 20:46:02,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-08 20:46:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:46:02,068 INFO L225 Difference]: With dead ends: 975 [2024-11-08 20:46:02,069 INFO L226 Difference]: Without dead ends: 637 [2024-11-08 20:46:02,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-08 20:46:02,071 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 357 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 20:46:02,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1341 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 20:46:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-08 20:46:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 347. [2024-11-08 20:46:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 299 states have (on average 1.3411371237458194) internal successors, (401), 300 states have internal predecessors, (401), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:46:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 479 transitions. [2024-11-08 20:46:02,113 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 479 transitions. Word has length 190 [2024-11-08 20:46:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:46:02,113 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 479 transitions. [2024-11-08 20:46:02,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:46:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 479 transitions. [2024-11-08 20:46:02,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 20:46:02,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:46:02,115 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:46:02,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 20:46:02,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:46:02,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:46:02,116 INFO L85 PathProgramCache]: Analyzing trace with hash -144355016, now seen corresponding path program 1 times [2024-11-08 20:46:02,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:46:02,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574143050] [2024-11-08 20:46:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:46:02,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:46:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:46:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:46:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:46:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:46:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:46:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:46:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:46:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:46:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:46:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:46:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:46:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 20:46:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:46:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 20:46:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:46:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 20:46:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:46:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:46:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:46:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:46:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:46:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 20:46:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:46:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-08 20:46:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-08 20:46:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:46:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:46:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:46:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 20:46:02,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:46:02,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574143050] [2024-11-08 20:46:02,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574143050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:46:02,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:46:02,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 20:46:02,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963531238] [2024-11-08 20:46:02,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:46:02,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 20:46:02,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:46:02,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 20:46:02,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:46:02,613 INFO L87 Difference]: Start difference. First operand 347 states and 479 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:46:03,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:46:03,033 INFO L93 Difference]: Finished difference Result 839 states and 1133 transitions. [2024-11-08 20:46:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 20:46:03,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-08 20:46:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:46:03,037 INFO L225 Difference]: With dead ends: 839 [2024-11-08 20:46:03,037 INFO L226 Difference]: Without dead ends: 495 [2024-11-08 20:46:03,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-08 20:46:03,039 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 75 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:46:03,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 930 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:46:03,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-08 20:46:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 359. [2024-11-08 20:46:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 311 states have (on average 1.3408360128617363) internal successors, (417), 312 states have internal predecessors, (417), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:46:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 495 transitions. [2024-11-08 20:46:03,074 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 495 transitions. Word has length 190 [2024-11-08 20:46:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:46:03,075 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 495 transitions. [2024-11-08 20:46:03,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 20:46:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 495 transitions. [2024-11-08 20:46:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 20:46:03,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:46:03,076 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:46:03,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 20:46:03,077 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:46:03,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:46:03,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1264651464, now seen corresponding path program 1 times [2024-11-08 20:46:03,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:46:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986809461] [2024-11-08 20:46:03,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:46:03,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:46:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 20:46:03,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273316531] [2024-11-08 20:46:03,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:46:03,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:46:03,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:46:03,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:46:03,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 20:46:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:46:03,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:46:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:46:03,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:46:03,475 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:46:03,476 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:46:03,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 20:46:03,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:46:03,682 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:46:03,829 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:46:03,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:46:03 BoogieIcfgContainer [2024-11-08 20:46:03,831 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:46:03,832 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:46:03,832 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:46:03,833 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:46:03,834 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:45:31" (3/4) ... [2024-11-08 20:46:03,836 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:46:03,837 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:46:03,838 INFO L158 Benchmark]: Toolchain (without parser) took 33510.72ms. Allocated memory was 155.2MB in the beginning and 522.2MB in the end (delta: 367.0MB). Free memory was 100.8MB in the beginning and 266.2MB in the end (delta: -165.5MB). Peak memory consumption was 201.0MB. Max. memory is 16.1GB. [2024-11-08 20:46:03,838 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:46:03,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.90ms. Allocated memory is still 155.2MB. Free memory was 100.2MB in the beginning and 83.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 20:46:03,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.03ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 125.4MB in the end (delta: -41.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-08 20:46:03,839 INFO L158 Benchmark]: Boogie Preprocessor took 58.87ms. Allocated memory is still 155.2MB. Free memory was 125.4MB in the beginning and 120.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:46:03,840 INFO L158 Benchmark]: RCFGBuilder took 621.46ms. Allocated memory is still 155.2MB. Free memory was 120.8MB in the beginning and 101.5MB in the end (delta: 19.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 20:46:03,840 INFO L158 Benchmark]: TraceAbstraction took 32354.56ms. Allocated memory was 155.2MB in the beginning and 522.2MB in the end (delta: 367.0MB). Free memory was 100.7MB in the beginning and 266.2MB in the end (delta: -165.5MB). Peak memory consumption was 203.0MB. Max. memory is 16.1GB. [2024-11-08 20:46:03,841 INFO L158 Benchmark]: Witness Printer took 5.33ms. Allocated memory is still 522.2MB. Free memory is still 266.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:46:03,845 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 58.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.90ms. Allocated memory is still 155.2MB. Free memory was 100.2MB in the beginning and 83.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.03ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 125.4MB in the end (delta: -41.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.87ms. Allocated memory is still 155.2MB. Free memory was 125.4MB in the beginning and 120.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 621.46ms. Allocated memory is still 155.2MB. Free memory was 120.8MB in the beginning and 101.5MB in the end (delta: 19.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32354.56ms. Allocated memory was 155.2MB in the beginning and 522.2MB in the end (delta: 367.0MB). Free memory was 100.7MB in the beginning and 266.2MB in the end (delta: -165.5MB). Peak memory consumption was 203.0MB. Max. memory is 16.1GB. * Witness Printer took 5.33ms. Allocated memory is still 522.2MB. Free memory is still 266.2MB. 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 170, overapproximation of shiftLeft at line 170, overapproximation of someUnaryDOUBLEoperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned long int var_1_22 = 0; [L40] unsigned char var_1_23 = 64; [L41] unsigned char var_1_24 = 2; [L42] double var_1_25 = 127.75; [L43] double var_1_26 = 9999999999999.2; [L44] double var_1_27 = 9.1; [L45] signed long int var_1_28 = -64; [L46] unsigned char var_1_29 = 8; [L47] unsigned char var_1_30 = 10; [L48] unsigned char var_1_31 = 0; [L49] unsigned char last_1_var_1_10 = 32; [L50] unsigned short int last_1_var_1_12 = 16; [L51] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L174] isInitial = 1 [L175] FCALL initially() [L176] COND TRUE 1 [L177] CALL updateLastVariables() [L165] last_1_var_1_10 = var_1_10 [L166] last_1_var_1_12 = var_1_12 [L167] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L120] var_1_3 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L121] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L122] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L122] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] var_1_5 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L124] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L125] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L125] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L127] var_1_6 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L128] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L129] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L129] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L130] var_1_7 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L131] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L132] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L132] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L133] var_1_8 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L134] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L135] var_1_9 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L136] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L137] var_1_11 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L138] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L139] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L139] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L140] var_1_15 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L141] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L142] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L142] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L143] var_1_20 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L144] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L145] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L146] var_1_21 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L147] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L148] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L148] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L149] var_1_22 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L150] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L151] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L151] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L153] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L154] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L154] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L155] var_1_27 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L156] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L157] var_1_30 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L158] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L159] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L160] var_1_31 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L161] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L162] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L178] RET updateVariables() [L179] CALL step() [L55] COND FALSE !(var_1_20 || var_1_21) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L58] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L59] COND TRUE var_1_23 > var_1_19 [L60] var_1_25 = ((((999999.5) < 0 ) ? -(999999.5) : (999999.5))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L62] COND FALSE !(var_1_22 < ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L67] var_1_28 = -256 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L68] COND TRUE var_1_28 != -32 [L69] var_1_29 = (var_1_30 + var_1_31) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L73] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L74] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L76] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L77] COND TRUE var_1_6 <= stepLocal_2 [L78] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L82] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L82] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L89] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L91] var_1_18 = var_1_3 [L92] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L93] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L94] COND FALSE !((- var_1_9) <= var_1_8) [L107] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L109] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L110] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L110] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L111] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L179] RET step() [L180] CALL, EXPR property() [L170] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170-L171] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.1s, OverallIterations: 15, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3264 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3258 mSDsluCounter, 9990 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7453 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4745 IncrementalHoareTripleChecker+Invalid, 5011 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 2537 mSDtfsCounter, 4745 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1674 GetRequests, 1540 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=14, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1410 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 3393 NumberOfCodeBlocks, 3393 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3185 ConstructedInterpolants, 0 QuantifiedInterpolants, 10957 SizeOfPredicates, 9 NumberOfNonLiveVariables, 878 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 25323/25704 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 20:46:03,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_fillercodesize_ps-cn-25_file-9.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 e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:46:05,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:46:06,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:46:06,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:46:06,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:46:06,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:46:06,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:46:06,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:46:06,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:46:06,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:46:06,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:46:06,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:46:06,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:46:06,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:46:06,107 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:46:06,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:46:06,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:46:06,107 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:46:06,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:46:06,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:46:06,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:46:06,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:46:06,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:46:06,111 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:46:06,112 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:46:06,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:46:06,112 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:46:06,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:46:06,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:46:06,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:46:06,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:46:06,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:46:06,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:46:06,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:46:06,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:46:06,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:46:06,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:46:06,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:46:06,115 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:46:06,115 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:46:06,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:46:06,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:46:06,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:46:06,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:46:06,117 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 -> e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e [2024-11-08 20:46:06,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:46:06,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:46:06,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:46:06,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:46:06,449 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:46:06,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-08 20:46:08,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:46:08,387 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:46:08,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-08 20:46:08,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3186d6fd/e8260c804d2e4f44842f59b9b1ac8faa/FLAGce22104a4 [2024-11-08 20:46:08,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3186d6fd/e8260c804d2e4f44842f59b9b1ac8faa [2024-11-08 20:46:08,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:46:08,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:46:08,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:46:08,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:46:08,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:46:08,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd12564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08, skipping insertion in model container [2024-11-08 20:46:08,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:46:08,667 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_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-08 20:46:08,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:46:08,767 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:46:08,782 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_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-08 20:46:08,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:46:08,851 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:46:08,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08 WrapperNode [2024-11-08 20:46:08,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:46:08,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:46:08,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:46:08,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:46:08,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,914 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-08 20:46:08,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:46:08,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:46:08,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:46:08,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:46:08,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,958 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:46:08,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:46:08,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:46:08,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:46:08,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:46:08,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (1/1) ... [2024-11-08 20:46:08,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:46:09,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:46:09,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:46:09,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:46:09,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:46:09,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:46:09,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:46:09,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:46:09,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:46:09,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:46:09,143 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:46:09,147 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:46:09,670 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 20:46:09,671 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:46:09,686 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:46:09,686 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:46:09,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:46:09 BoogieIcfgContainer [2024-11-08 20:46:09,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:46:09,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:46:09,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:46:09,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:46:09,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:46:08" (1/3) ... [2024-11-08 20:46:09,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477a9f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:46:09, skipping insertion in model container [2024-11-08 20:46:09,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:46:08" (2/3) ... [2024-11-08 20:46:09,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477a9f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:46:09, skipping insertion in model container [2024-11-08 20:46:09,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:46:09" (3/3) ... [2024-11-08 20:46:09,696 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-08 20:46:09,712 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:46:09,713 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:46:09,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:46:09,792 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;@49555aed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:46:09,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:46:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:46:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 20:46:09,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:46:09,816 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:46:09,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:46:09,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:46:09,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1692540324, now seen corresponding path program 1 times [2024-11-08 20:46:09,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:46:09,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008709446] [2024-11-08 20:46:09,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:46:09,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:46:09,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:46:09,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:46:09,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 20:46:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:10,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:46:10,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:46:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-08 20:46:10,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:46:10,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:46:10,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008709446] [2024-11-08 20:46:10,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008709446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:46:10,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:46:10,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:46:10,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067722720] [2024-11-08 20:46:10,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:46:10,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:46:10,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:46:10,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:46:10,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:46:10,272 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:46:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:46:10,303 INFO L93 Difference]: Finished difference Result 157 states and 276 transitions. [2024-11-08 20:46:10,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:46:10,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2024-11-08 20:46:10,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:46:10,315 INFO L225 Difference]: With dead ends: 157 [2024-11-08 20:46:10,316 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 20:46:10,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:46:10,324 INFO L432 NwaCegarLoop]: 119 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, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:46:10,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:46:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 20:46:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-08 20:46:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 20:46:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2024-11-08 20:46:10,384 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 178 [2024-11-08 20:46:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:46:10,384 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2024-11-08 20:46:10,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 20:46:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2024-11-08 20:46:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 20:46:10,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:46:10,388 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:46:10,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 20:46:10,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:46:10,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:46:10,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:46:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1469662952, now seen corresponding path program 1 times [2024-11-08 20:46:10,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:46:10,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826433339] [2024-11-08 20:46:10,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:46:10,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:46:10,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:46:10,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:46:10,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 20:46:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:10,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 20:46:10,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:46:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 501 proven. 126 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-11-08 20:46:12,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:46:14,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:46:14,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826433339] [2024-11-08 20:46:14,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826433339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:46:14,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [778640993] [2024-11-08 20:46:14,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:46:14,282 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 20:46:14,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 20:46:14,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 20:46:14,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-08 20:46:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:14,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 20:46:14,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:46:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 477 proven. 66 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-08 20:46:16,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:46:17,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [778640993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:46:17,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:46:17,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 9 [2024-11-08 20:46:17,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112789500] [2024-11-08 20:46:17,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:46:17,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 20:46:17,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:46:17,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 20:46:17,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2024-11-08 20:46:17,062 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2024-11-08 20:46:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:46:17,837 INFO L93 Difference]: Finished difference Result 239 states and 360 transitions. [2024-11-08 20:46:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 20:46:17,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) Word has length 179 [2024-11-08 20:46:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:46:17,848 INFO L225 Difference]: With dead ends: 239 [2024-11-08 20:46:17,848 INFO L226 Difference]: Without dead ends: 164 [2024-11-08 20:46:17,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=418, Unknown=0, NotChecked=0, Total=650 [2024-11-08 20:46:17,850 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 76 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 20:46:17,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 550 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 20:46:17,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-08 20:46:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2024-11-08 20:46:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 20:46:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2024-11-08 20:46:17,897 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 179 [2024-11-08 20:46:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:46:17,898 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2024-11-08 20:46:17,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2024-11-08 20:46:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2024-11-08 20:46:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 20:46:17,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:46:17,902 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:46:17,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-08 20:46:18,111 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 (3)] Ended with exit code 0 [2024-11-08 20:46:18,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:46:18,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:46:18,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:46:18,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2056468966, now seen corresponding path program 1 times [2024-11-08 20:46:18,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:46:18,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414469154] [2024-11-08 20:46:18,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:46:18,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:46:18,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:46:18,309 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:46:18,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 20:46:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:46:18,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 20:46:18,487 INFO L278 TraceCheckSpWp]: Computing forward predicates...