./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.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 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:55:59,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:56:00,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:56:00,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:56:00,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:56:00,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:56:00,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:56:00,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:56:00,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:56:00,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:56:00,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:56:00,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:56:00,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:56:00,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:56:00,074 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:56:00,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:56:00,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:56:00,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:56:00,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:56:00,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:56:00,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:56:00,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:56:00,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:56:00,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:56:00,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:56:00,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:56:00,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:56:00,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:56:00,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:56:00,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:56:00,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:56:00,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:56:00,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:56:00,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:56:00,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:56:00,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:56:00,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:56:00,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:56:00,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:56:00,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:56:00,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:56:00,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:56:00,080 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 -> 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e [2024-11-16 14:56:00,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:56:00,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:56:00,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:56:00,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:56:00,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:56:00,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-11-16 14:56:01,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:56:01,671 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:56:01,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-11-16 14:56:01,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fae04027/ad00038a953c4f709c3eb7aeac280a58/FLAG039efdfca [2024-11-16 14:56:02,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fae04027/ad00038a953c4f709c3eb7aeac280a58 [2024-11-16 14:56:02,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:56:02,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:56:02,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:56:02,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:56:02,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:56:02,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ee4ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02, skipping insertion in model container [2024-11-16 14:56:02,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:56:02,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-11-16 14:56:02,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:56:02,309 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:56:02,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-11-16 14:56:02,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:56:02,369 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:56:02,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02 WrapperNode [2024-11-16 14:56:02,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:56:02,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:56:02,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:56:02,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:56:02,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,418 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-11-16 14:56:02,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:56:02,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:56:02,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:56:02,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:56:02,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,455 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-16 14:56:02,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,467 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:56:02,477 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:56:02,477 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:56:02,477 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:56:02,478 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (1/1) ... [2024-11-16 14:56:02,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:56:02,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:56:02,509 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-16 14:56:02,512 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-16 14:56:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:56:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:56:02,547 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:56:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:56:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:56:02,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:56:02,635 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:56:02,636 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:56:02,986 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 14:56:02,986 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:56:03,004 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:56:03,004 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 14:56:03,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:56:03 BoogieIcfgContainer [2024-11-16 14:56:03,005 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:56:03,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:56:03,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:56:03,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:56:03,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:56:02" (1/3) ... [2024-11-16 14:56:03,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a551544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:56:03, skipping insertion in model container [2024-11-16 14:56:03,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:02" (2/3) ... [2024-11-16 14:56:03,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a551544 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:56:03, skipping insertion in model container [2024-11-16 14:56:03,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:56:03" (3/3) ... [2024-11-16 14:56:03,013 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-11-16 14:56:03,024 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:56:03,025 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:56:03,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:56:03,074 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;@423f9fde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:56:03,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:56:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:56:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 14:56:03,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:03,089 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:03,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:03,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1935962487, now seen corresponding path program 1 times [2024-11-16 14:56:03,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:03,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760991177] [2024-11-16 14:56:03,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:03,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:03,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760991177] [2024-11-16 14:56:03,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760991177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:03,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:03,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:56:03,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911285766] [2024-11-16 14:56:03,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:03,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:56:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:03,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:56:03,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:56:03,455 INFO L87 Difference]: Start difference. First operand has 93 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:03,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:03,483 INFO L93 Difference]: Finished difference Result 178 states and 299 transitions. [2024-11-16 14:56:03,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:56:03,485 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 166 [2024-11-16 14:56:03,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:03,491 INFO L225 Difference]: With dead ends: 178 [2024-11-16 14:56:03,491 INFO L226 Difference]: Without dead ends: 88 [2024-11-16 14:56:03,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-16 14:56:03,496 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:03,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:56:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-16 14:56:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-16 14:56:03,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 62 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:56:03,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 132 transitions. [2024-11-16 14:56:03,530 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 132 transitions. Word has length 166 [2024-11-16 14:56:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:03,530 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 132 transitions. [2024-11-16 14:56:03,530 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 132 transitions. [2024-11-16 14:56:03,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 14:56:03,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:03,533 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:03,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:56:03,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:03,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:03,534 INFO L85 PathProgramCache]: Analyzing trace with hash -592364711, now seen corresponding path program 1 times [2024-11-16 14:56:03,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:03,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357991545] [2024-11-16 14:56:03,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:03,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:03,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:03,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357991545] [2024-11-16 14:56:03,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357991545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:03,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:03,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:56:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278322619] [2024-11-16 14:56:03,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:03,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:56:03,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:03,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:56:03,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:56:03,829 INFO L87 Difference]: Start difference. First operand 88 states and 132 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:03,862 INFO L93 Difference]: Finished difference Result 174 states and 263 transitions. [2024-11-16 14:56:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:56:03,865 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2024-11-16 14:56:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:03,866 INFO L225 Difference]: With dead ends: 174 [2024-11-16 14:56:03,866 INFO L226 Difference]: Without dead ends: 89 [2024-11-16 14:56:03,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-16 14:56:03,868 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:03,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:56:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-16 14:56:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-16 14:56:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:56:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2024-11-16 14:56:03,884 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 133 transitions. Word has length 166 [2024-11-16 14:56:03,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:03,887 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 133 transitions. [2024-11-16 14:56:03,887 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 133 transitions. [2024-11-16 14:56:03,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 14:56:03,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:03,890 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:03,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:56:03,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:03,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:03,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1464014165, now seen corresponding path program 1 times [2024-11-16 14:56:03,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:03,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720466925] [2024-11-16 14:56:03,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:04,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720466925] [2024-11-16 14:56:04,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720466925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:04,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:04,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:56:04,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347708628] [2024-11-16 14:56:04,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:04,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:56:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:04,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:56:04,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:56:04,163 INFO L87 Difference]: Start difference. First operand 89 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:04,346 INFO L93 Difference]: Finished difference Result 260 states and 391 transitions. [2024-11-16 14:56:04,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:56:04,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-16 14:56:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:04,350 INFO L225 Difference]: With dead ends: 260 [2024-11-16 14:56:04,352 INFO L226 Difference]: Without dead ends: 174 [2024-11-16 14:56:04,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:56:04,356 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 125 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:04,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 308 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:56:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-16 14:56:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 93. [2024-11-16 14:56:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:56:04,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 138 transitions. [2024-11-16 14:56:04,365 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 138 transitions. Word has length 167 [2024-11-16 14:56:04,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:04,366 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 138 transitions. [2024-11-16 14:56:04,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:04,366 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 138 transitions. [2024-11-16 14:56:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 14:56:04,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:04,372 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:04,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:56:04,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:04,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:04,373 INFO L85 PathProgramCache]: Analyzing trace with hash 278796170, now seen corresponding path program 1 times [2024-11-16 14:56:04,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:04,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363224085] [2024-11-16 14:56:04,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:04,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:04,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:04,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363224085] [2024-11-16 14:56:04,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363224085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:04,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:04,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:56:04,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286753905] [2024-11-16 14:56:04,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:04,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:56:04,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:04,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:56:04,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:56:04,759 INFO L87 Difference]: Start difference. First operand 93 states and 138 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:04,813 INFO L93 Difference]: Finished difference Result 257 states and 388 transitions. [2024-11-16 14:56:04,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:56:04,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-16 14:56:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:04,816 INFO L225 Difference]: With dead ends: 257 [2024-11-16 14:56:04,816 INFO L226 Difference]: Without dead ends: 167 [2024-11-16 14:56:04,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:56:04,817 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 60 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:04,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 367 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:56:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-16 14:56:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2024-11-16 14:56:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 14:56:04,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 230 transitions. [2024-11-16 14:56:04,840 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 230 transitions. Word has length 167 [2024-11-16 14:56:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:04,840 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 230 transitions. [2024-11-16 14:56:04,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 230 transitions. [2024-11-16 14:56:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 14:56:04,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:04,846 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:04,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 14:56:04,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:04,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash -416051624, now seen corresponding path program 1 times [2024-11-16 14:56:04,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:04,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808837543] [2024-11-16 14:56:04,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:04,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:04,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:05,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:05,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808837543] [2024-11-16 14:56:05,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808837543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:05,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:05,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:56:05,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713076648] [2024-11-16 14:56:05,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:05,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:56:05,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:05,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:56:05,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:56:05,025 INFO L87 Difference]: Start difference. First operand 153 states and 230 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:05,056 INFO L93 Difference]: Finished difference Result 245 states and 368 transitions. [2024-11-16 14:56:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:56:05,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2024-11-16 14:56:05,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:05,058 INFO L225 Difference]: With dead ends: 245 [2024-11-16 14:56:05,058 INFO L226 Difference]: Without dead ends: 155 [2024-11-16 14:56:05,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:56:05,062 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:05,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 370 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:56:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-16 14:56:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-16 14:56:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 14:56:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 231 transitions. [2024-11-16 14:56:05,084 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 231 transitions. Word has length 168 [2024-11-16 14:56:05,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:05,085 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 231 transitions. [2024-11-16 14:56:05,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:05,085 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 231 transitions. [2024-11-16 14:56:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 14:56:05,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:05,086 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:05,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 14:56:05,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:05,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:05,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1037978262, now seen corresponding path program 1 times [2024-11-16 14:56:05,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:05,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219597158] [2024-11-16 14:56:05,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:05,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:05,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:05,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219597158] [2024-11-16 14:56:05,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219597158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:05,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:05,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 14:56:05,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314601257] [2024-11-16 14:56:05,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:05,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:56:05,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:05,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:56:05,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:56:05,547 INFO L87 Difference]: Start difference. First operand 154 states and 231 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:05,945 INFO L93 Difference]: Finished difference Result 444 states and 655 transitions. [2024-11-16 14:56:05,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 14:56:05,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 169 [2024-11-16 14:56:05,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:05,948 INFO L225 Difference]: With dead ends: 444 [2024-11-16 14:56:05,948 INFO L226 Difference]: Without dead ends: 353 [2024-11-16 14:56:05,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 14:56:05,949 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 291 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:05,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 520 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 14:56:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-16 14:56:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 302. [2024-11-16 14:56:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 205 states have (on average 1.302439024390244) internal successors, (267), 207 states have internal predecessors, (267), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-16 14:56:05,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 443 transitions. [2024-11-16 14:56:05,978 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 443 transitions. Word has length 169 [2024-11-16 14:56:05,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:05,978 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 443 transitions. [2024-11-16 14:56:05,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:05,979 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 443 transitions. [2024-11-16 14:56:05,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 14:56:05,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:05,981 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:05,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 14:56:05,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:05,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:05,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1643261418, now seen corresponding path program 1 times [2024-11-16 14:56:05,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:05,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325197818] [2024-11-16 14:56:05,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:05,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:06,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:06,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325197818] [2024-11-16 14:56:06,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325197818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:06,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:06,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:56:06,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304842239] [2024-11-16 14:56:06,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:06,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:56:06,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:06,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:56:06,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:56:06,115 INFO L87 Difference]: Start difference. First operand 302 states and 443 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:06,240 INFO L93 Difference]: Finished difference Result 526 states and 773 transitions. [2024-11-16 14:56:06,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:56:06,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 169 [2024-11-16 14:56:06,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:06,244 INFO L225 Difference]: With dead ends: 526 [2024-11-16 14:56:06,244 INFO L226 Difference]: Without dead ends: 302 [2024-11-16 14:56:06,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:56:06,245 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 125 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:06,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 191 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:56:06,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-16 14:56:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 294. [2024-11-16 14:56:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 197 states have (on average 1.2893401015228427) internal successors, (254), 199 states have internal predecessors, (254), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-16 14:56:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 430 transitions. [2024-11-16 14:56:06,280 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 430 transitions. Word has length 169 [2024-11-16 14:56:06,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:06,281 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 430 transitions. [2024-11-16 14:56:06,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 430 transitions. [2024-11-16 14:56:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 14:56:06,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:06,283 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:06,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 14:56:06,284 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:06,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash -908895543, now seen corresponding path program 1 times [2024-11-16 14:56:06,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040115882] [2024-11-16 14:56:06,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:56:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:06,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040115882] [2024-11-16 14:56:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040115882] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:56:06,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990766547] [2024-11-16 14:56:06,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:06,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:56:06,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:56:06,558 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-16 14:56:06,561 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-16 14:56:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:06,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 14:56:06,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:56:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 485 proven. 48 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2024-11-16 14:56:07,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:56:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:56:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990766547] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:56:07,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:56:07,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 12] total 25 [2024-11-16 14:56:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984290425] [2024-11-16 14:56:07,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:56:07,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-16 14:56:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:07,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-16 14:56:07,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2024-11-16 14:56:07,721 INFO L87 Difference]: Start difference. First operand 294 states and 430 transitions. Second operand has 25 states, 25 states have (on average 5.92) internal successors, (148), 25 states have internal predecessors, (148), 5 states have call successors, (71), 3 states have call predecessors, (71), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2024-11-16 14:56:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:11,024 INFO L93 Difference]: Finished difference Result 1491 states and 2004 transitions. [2024-11-16 14:56:11,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2024-11-16 14:56:11,025 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.92) internal successors, (148), 25 states have internal predecessors, (148), 5 states have call successors, (71), 3 states have call predecessors, (71), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) Word has length 169 [2024-11-16 14:56:11,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:11,030 INFO L225 Difference]: With dead ends: 1491 [2024-11-16 14:56:11,030 INFO L226 Difference]: Without dead ends: 1255 [2024-11-16 14:56:11,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5385 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2226, Invalid=13274, Unknown=0, NotChecked=0, Total=15500 [2024-11-16 14:56:11,035 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1628 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:11,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 1706 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 14:56:11,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-16 14:56:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 958. [2024-11-16 14:56:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 677 states have (on average 1.2112259970457901) internal successors, (820), 691 states have internal predecessors, (820), 232 states have call successors, (232), 48 states have call predecessors, (232), 48 states have return successors, (232), 218 states have call predecessors, (232), 232 states have call successors, (232) [2024-11-16 14:56:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1284 transitions. [2024-11-16 14:56:11,100 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1284 transitions. Word has length 169 [2024-11-16 14:56:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:11,100 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1284 transitions. [2024-11-16 14:56:11,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.92) internal successors, (148), 25 states have internal predecessors, (148), 5 states have call successors, (71), 3 states have call predecessors, (71), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2024-11-16 14:56:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1284 transitions. [2024-11-16 14:56:11,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 14:56:11,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:11,102 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:11,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 14:56:11,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:56:11,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:11,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:11,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1798273432, now seen corresponding path program 1 times [2024-11-16 14:56:11,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:11,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18209662] [2024-11-16 14:56:11,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:11,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:11,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18209662] [2024-11-16 14:56:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18209662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:11,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:11,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:56:11,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970605978] [2024-11-16 14:56:11,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:11,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:56:11,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:11,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:56:11,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:56:11,411 INFO L87 Difference]: Start difference. First operand 958 states and 1284 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:11,508 INFO L93 Difference]: Finished difference Result 1895 states and 2522 transitions. [2024-11-16 14:56:11,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:56:11,509 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 169 [2024-11-16 14:56:11,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:11,514 INFO L225 Difference]: With dead ends: 1895 [2024-11-16 14:56:11,514 INFO L226 Difference]: Without dead ends: 1071 [2024-11-16 14:56:11,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-16 14:56:11,517 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 35 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:11,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 248 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:56:11,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-16 14:56:11,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1061. [2024-11-16 14:56:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 763 states have (on average 1.2083879423328965) internal successors, (922), 780 states have internal predecessors, (922), 238 states have call successors, (238), 59 states have call predecessors, (238), 59 states have return successors, (238), 221 states have call predecessors, (238), 238 states have call successors, (238) [2024-11-16 14:56:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1398 transitions. [2024-11-16 14:56:11,586 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1398 transitions. Word has length 169 [2024-11-16 14:56:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:11,587 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1398 transitions. [2024-11-16 14:56:11,587 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1398 transitions. [2024-11-16 14:56:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 14:56:11,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:11,589 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:11,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 14:56:11,589 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:11,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash -290721623, now seen corresponding path program 1 times [2024-11-16 14:56:11,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:11,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113344366] [2024-11-16 14:56:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:11,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:11,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:11,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113344366] [2024-11-16 14:56:11,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113344366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:11,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:11,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:56:11,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557057382] [2024-11-16 14:56:11,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:11,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:56:11,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:11,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:56:11,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:56:11,776 INFO L87 Difference]: Start difference. First operand 1061 states and 1398 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:11,893 INFO L93 Difference]: Finished difference Result 2240 states and 2950 transitions. [2024-11-16 14:56:11,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:56:11,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 169 [2024-11-16 14:56:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:11,900 INFO L225 Difference]: With dead ends: 2240 [2024-11-16 14:56:11,900 INFO L226 Difference]: Without dead ends: 1292 [2024-11-16 14:56:11,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:56:11,903 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 151 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:11,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 557 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:56:11,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2024-11-16 14:56:11,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1036. [2024-11-16 14:56:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 738 states have (on average 1.1693766937669376) internal successors, (863), 752 states have internal predecessors, (863), 232 states have call successors, (232), 65 states have call predecessors, (232), 65 states have return successors, (232), 218 states have call predecessors, (232), 232 states have call successors, (232) [2024-11-16 14:56:11,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1327 transitions. [2024-11-16 14:56:11,997 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1327 transitions. Word has length 169 [2024-11-16 14:56:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:11,997 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1327 transitions. [2024-11-16 14:56:11,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1327 transitions. [2024-11-16 14:56:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 14:56:11,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:11,999 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:11,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 14:56:11,999 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:12,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:12,000 INFO L85 PathProgramCache]: Analyzing trace with hash -161638904, now seen corresponding path program 1 times [2024-11-16 14:56:12,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:12,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229998073] [2024-11-16 14:56:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:16,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:16,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229998073] [2024-11-16 14:56:16,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229998073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:16,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:16,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 14:56:16,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084367385] [2024-11-16 14:56:16,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:16,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 14:56:16,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:16,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 14:56:16,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-16 14:56:16,319 INFO L87 Difference]: Start difference. First operand 1036 states and 1327 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:17,574 INFO L93 Difference]: Finished difference Result 2513 states and 3232 transitions. [2024-11-16 14:56:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 14:56:17,575 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 169 [2024-11-16 14:56:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:17,581 INFO L225 Difference]: With dead ends: 2513 [2024-11-16 14:56:17,581 INFO L226 Difference]: Without dead ends: 1648 [2024-11-16 14:56:17,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2024-11-16 14:56:17,583 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 300 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:17,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 811 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 14:56:17,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-16 14:56:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1484. [2024-11-16 14:56:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1097 states have (on average 1.1969006381039198) internal successors, (1313), 1116 states have internal predecessors, (1313), 301 states have call successors, (301), 85 states have call predecessors, (301), 85 states have return successors, (301), 282 states have call predecessors, (301), 301 states have call successors, (301) [2024-11-16 14:56:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1915 transitions. [2024-11-16 14:56:17,682 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1915 transitions. Word has length 169 [2024-11-16 14:56:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:17,682 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1915 transitions. [2024-11-16 14:56:17,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1915 transitions. [2024-11-16 14:56:17,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-16 14:56:17,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:17,684 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:17,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 14:56:17,685 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:17,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash -358152409, now seen corresponding path program 1 times [2024-11-16 14:56:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:17,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552163350] [2024-11-16 14:56:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:17,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:18,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:18,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552163350] [2024-11-16 14:56:18,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552163350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:18,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:18,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 14:56:18,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319874732] [2024-11-16 14:56:18,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:18,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:56:18,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:56:18,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:56:18,129 INFO L87 Difference]: Start difference. First operand 1484 states and 1915 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:18,513 INFO L93 Difference]: Finished difference Result 3519 states and 4481 transitions. [2024-11-16 14:56:18,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:56:18,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 169 [2024-11-16 14:56:18,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:18,522 INFO L225 Difference]: With dead ends: 3519 [2024-11-16 14:56:18,522 INFO L226 Difference]: Without dead ends: 2274 [2024-11-16 14:56:18,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 14:56:18,525 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 181 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:18,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 271 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:56:18,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2024-11-16 14:56:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 1551. [2024-11-16 14:56:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1164 states have (on average 1.2061855670103092) internal successors, (1404), 1183 states have internal predecessors, (1404), 301 states have call successors, (301), 85 states have call predecessors, (301), 85 states have return successors, (301), 282 states have call predecessors, (301), 301 states have call successors, (301) [2024-11-16 14:56:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2006 transitions. [2024-11-16 14:56:18,662 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2006 transitions. Word has length 169 [2024-11-16 14:56:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:18,663 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2006 transitions. [2024-11-16 14:56:18,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2006 transitions. [2024-11-16 14:56:18,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 14:56:18,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:18,664 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:18,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 14:56:18,664 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:18,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:18,665 INFO L85 PathProgramCache]: Analyzing trace with hash -261479820, now seen corresponding path program 1 times [2024-11-16 14:56:18,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:18,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308828891] [2024-11-16 14:56:18,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:18,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:18,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:18,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308828891] [2024-11-16 14:56:18,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308828891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:18,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:18,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 14:56:18,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538895794] [2024-11-16 14:56:18,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:18,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 14:56:18,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:18,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 14:56:18,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 14:56:18,981 INFO L87 Difference]: Start difference. First operand 1551 states and 2006 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:19,331 INFO L93 Difference]: Finished difference Result 2950 states and 3808 transitions. [2024-11-16 14:56:19,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:56:19,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 170 [2024-11-16 14:56:19,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:19,338 INFO L225 Difference]: With dead ends: 2950 [2024-11-16 14:56:19,338 INFO L226 Difference]: Without dead ends: 1582 [2024-11-16 14:56:19,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 14:56:19,341 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 92 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:19,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 459 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:56:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2024-11-16 14:56:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1553. [2024-11-16 14:56:19,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1166 states have (on average 1.2066895368782162) internal successors, (1407), 1185 states have internal predecessors, (1407), 301 states have call successors, (301), 85 states have call predecessors, (301), 85 states have return successors, (301), 282 states have call predecessors, (301), 301 states have call successors, (301) [2024-11-16 14:56:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2009 transitions. [2024-11-16 14:56:19,456 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2009 transitions. Word has length 170 [2024-11-16 14:56:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:19,456 INFO L471 AbstractCegarLoop]: Abstraction has 1553 states and 2009 transitions. [2024-11-16 14:56:19,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2009 transitions. [2024-11-16 14:56:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 14:56:19,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:19,458 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:19,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 14:56:19,458 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:19,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:19,458 INFO L85 PathProgramCache]: Analyzing trace with hash -328486573, now seen corresponding path program 1 times [2024-11-16 14:56:19,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:19,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692758243] [2024-11-16 14:56:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:19,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:24,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692758243] [2024-11-16 14:56:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692758243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:24,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 14:56:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318253954] [2024-11-16 14:56:24,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:24,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 14:56:24,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:24,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 14:56:24,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-16 14:56:24,626 INFO L87 Difference]: Start difference. First operand 1553 states and 2009 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:27,009 INFO L93 Difference]: Finished difference Result 1761 states and 2267 transitions. [2024-11-16 14:56:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 14:56:27,010 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 170 [2024-11-16 14:56:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:27,017 INFO L225 Difference]: With dead ends: 1761 [2024-11-16 14:56:27,017 INFO L226 Difference]: Without dead ends: 1758 [2024-11-16 14:56:27,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2024-11-16 14:56:27,018 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 368 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:27,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1208 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 14:56:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2024-11-16 14:56:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1601. [2024-11-16 14:56:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1214 states have (on average 1.2108731466227347) internal successors, (1470), 1233 states have internal predecessors, (1470), 301 states have call successors, (301), 85 states have call predecessors, (301), 85 states have return successors, (301), 282 states have call predecessors, (301), 301 states have call successors, (301) [2024-11-16 14:56:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2072 transitions. [2024-11-16 14:56:27,125 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2072 transitions. Word has length 170 [2024-11-16 14:56:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:27,125 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2072 transitions. [2024-11-16 14:56:27,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2072 transitions. [2024-11-16 14:56:27,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 14:56:27,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:27,127 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:27,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 14:56:27,127 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:27,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:27,128 INFO L85 PathProgramCache]: Analyzing trace with hash -525000078, now seen corresponding path program 1 times [2024-11-16 14:56:27,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:27,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056113371] [2024-11-16 14:56:27,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:27,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:27,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:27,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056113371] [2024-11-16 14:56:27,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056113371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:27,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:27,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 14:56:27,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50984564] [2024-11-16 14:56:27,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:27,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:56:27,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:27,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:56:27,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:56:27,420 INFO L87 Difference]: Start difference. First operand 1601 states and 2072 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:27,683 INFO L93 Difference]: Finished difference Result 3291 states and 4218 transitions. [2024-11-16 14:56:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 14:56:27,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 170 [2024-11-16 14:56:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:27,692 INFO L225 Difference]: With dead ends: 3291 [2024-11-16 14:56:27,692 INFO L226 Difference]: Without dead ends: 1945 [2024-11-16 14:56:27,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:56:27,695 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 118 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:27,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 593 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:56:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2024-11-16 14:56:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1591. [2024-11-16 14:56:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1204 states have (on average 1.2109634551495017) internal successors, (1458), 1223 states have internal predecessors, (1458), 301 states have call successors, (301), 85 states have call predecessors, (301), 85 states have return successors, (301), 282 states have call predecessors, (301), 301 states have call successors, (301) [2024-11-16 14:56:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2060 transitions. [2024-11-16 14:56:27,807 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2060 transitions. Word has length 170 [2024-11-16 14:56:27,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:27,807 INFO L471 AbstractCegarLoop]: Abstraction has 1591 states and 2060 transitions. [2024-11-16 14:56:27,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2060 transitions. [2024-11-16 14:56:27,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 14:56:27,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:27,810 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:27,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 14:56:27,810 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:27,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:27,810 INFO L85 PathProgramCache]: Analyzing trace with hash -708928452, now seen corresponding path program 1 times [2024-11-16 14:56:27,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:27,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336566688] [2024-11-16 14:56:27,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:27,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:56:27,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336566688] [2024-11-16 14:56:27,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336566688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:56:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726489526] [2024-11-16 14:56:27,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:27,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:56:27,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:56:27,983 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-16 14:56:27,984 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-16 14:56:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:28,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 14:56:28,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:56:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 503 proven. 90 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-11-16 14:56:28,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:56:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-16 14:56:28,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726489526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:56:28,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:56:28,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2024-11-16 14:56:28,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342031360] [2024-11-16 14:56:28,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:56:28,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 14:56:28,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 14:56:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2024-11-16 14:56:28,522 INFO L87 Difference]: Start difference. First operand 1591 states and 2060 transitions. Second operand has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-11-16 14:56:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:28,795 INFO L93 Difference]: Finished difference Result 2855 states and 3634 transitions. [2024-11-16 14:56:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 14:56:28,796 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) Word has length 170 [2024-11-16 14:56:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:28,803 INFO L225 Difference]: With dead ends: 2855 [2024-11-16 14:56:28,803 INFO L226 Difference]: Without dead ends: 1556 [2024-11-16 14:56:28,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=330, Unknown=0, NotChecked=0, Total=506 [2024-11-16 14:56:28,806 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 327 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:28,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 218 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:56:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-11-16 14:56:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1154. [2024-11-16 14:56:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 844 states have (on average 1.1729857819905214) internal successors, (990), 854 states have internal predecessors, (990), 236 states have call successors, (236), 73 states have call predecessors, (236), 73 states have return successors, (236), 226 states have call predecessors, (236), 236 states have call successors, (236) [2024-11-16 14:56:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1462 transitions. [2024-11-16 14:56:28,905 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1462 transitions. Word has length 170 [2024-11-16 14:56:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:28,905 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1462 transitions. [2024-11-16 14:56:28,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-11-16 14:56:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1462 transitions. [2024-11-16 14:56:28,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 14:56:28,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:28,907 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:28,920 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-16 14:56:29,107 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,SelfDestructingSolverStorable15 [2024-11-16 14:56:29,110 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:29,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:29,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1836577673, now seen corresponding path program 1 times [2024-11-16 14:56:29,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:29,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728259219] [2024-11-16 14:56:29,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:29,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:31,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728259219] [2024-11-16 14:56:31,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728259219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:31,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:31,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 14:56:31,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320928608] [2024-11-16 14:56:31,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:31,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 14:56:31,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:31,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 14:56:31,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-16 14:56:31,992 INFO L87 Difference]: Start difference. First operand 1154 states and 1462 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:33,860 INFO L93 Difference]: Finished difference Result 2106 states and 2663 transitions. [2024-11-16 14:56:33,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 14:56:33,860 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 171 [2024-11-16 14:56:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:33,865 INFO L225 Difference]: With dead ends: 2106 [2024-11-16 14:56:33,865 INFO L226 Difference]: Without dead ends: 1238 [2024-11-16 14:56:33,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=205, Invalid=497, Unknown=0, NotChecked=0, Total=702 [2024-11-16 14:56:33,867 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 316 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:33,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 633 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 14:56:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2024-11-16 14:56:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1183. [2024-11-16 14:56:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 873 states have (on average 1.1695303550973655) internal successors, (1021), 883 states have internal predecessors, (1021), 236 states have call successors, (236), 73 states have call predecessors, (236), 73 states have return successors, (236), 226 states have call predecessors, (236), 236 states have call successors, (236) [2024-11-16 14:56:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1493 transitions. [2024-11-16 14:56:33,982 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1493 transitions. Word has length 171 [2024-11-16 14:56:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:33,982 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1493 transitions. [2024-11-16 14:56:33,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1493 transitions. [2024-11-16 14:56:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 14:56:33,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:33,983 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:33,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 14:56:33,983 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:33,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2033091178, now seen corresponding path program 1 times [2024-11-16 14:56:33,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:33,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579346168] [2024-11-16 14:56:33,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:33,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:56:37,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:37,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579346168] [2024-11-16 14:56:37,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579346168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:37,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:37,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-16 14:56:37,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065297051] [2024-11-16 14:56:37,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:37,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 14:56:37,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:37,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 14:56:37,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-16 14:56:37,572 INFO L87 Difference]: Start difference. First operand 1183 states and 1493 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:40,040 INFO L93 Difference]: Finished difference Result 2105 states and 2647 transitions. [2024-11-16 14:56:40,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 14:56:40,041 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 171 [2024-11-16 14:56:40,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:40,047 INFO L225 Difference]: With dead ends: 2105 [2024-11-16 14:56:40,047 INFO L226 Difference]: Without dead ends: 1245 [2024-11-16 14:56:40,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2024-11-16 14:56:40,051 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 248 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:40,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 815 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 14:56:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-11-16 14:56:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1189. [2024-11-16 14:56:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 879 states have (on average 1.1683731513083049) internal successors, (1027), 889 states have internal predecessors, (1027), 236 states have call successors, (236), 73 states have call predecessors, (236), 73 states have return successors, (236), 226 states have call predecessors, (236), 236 states have call successors, (236) [2024-11-16 14:56:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1499 transitions. [2024-11-16 14:56:40,161 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1499 transitions. Word has length 171 [2024-11-16 14:56:40,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:40,162 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1499 transitions. [2024-11-16 14:56:40,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:56:40,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1499 transitions. [2024-11-16 14:56:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 14:56:40,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:40,163 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:40,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 14:56:40,163 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:40,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:40,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1586238895, now seen corresponding path program 1 times [2024-11-16 14:56:40,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:40,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427611349] [2024-11-16 14:56:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:40,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:56:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:56:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:56:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:56:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:56:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:56:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:56:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:56:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:56:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:56:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:56:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:56:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:56:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:56:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:56:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:56:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:56:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:56:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:56:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:56:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:56:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:56:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:56:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:56:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:56:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:56:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427611349] [2024-11-16 14:56:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427611349] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:56:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787567854] [2024-11-16 14:56:40,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:40,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:56:40,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:56:40,459 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-16 14:56:40,460 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-16 14:56:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:40,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 14:56:40,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:56:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 503 proven. 90 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-11-16 14:56:40,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:56:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-16 14:56:41,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787567854] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:56:41,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:56:41,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 20 [2024-11-16 14:56:41,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251281196] [2024-11-16 14:56:41,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:56:41,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 14:56:41,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:56:41,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 14:56:41,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-16 14:56:41,273 INFO L87 Difference]: Start difference. First operand 1189 states and 1499 transitions. Second operand has 20 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 8 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 7 states have call predecessors, (72), 8 states have call successors, (72) [2024-11-16 14:56:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:41,909 INFO L93 Difference]: Finished difference Result 2239 states and 2808 transitions. [2024-11-16 14:56:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 14:56:41,910 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 8 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 7 states have call predecessors, (72), 8 states have call successors, (72) Word has length 171 [2024-11-16 14:56:41,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:41,915 INFO L225 Difference]: With dead ends: 2239 [2024-11-16 14:56:41,915 INFO L226 Difference]: Without dead ends: 1326 [2024-11-16 14:56:41,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=416, Invalid=990, Unknown=0, NotChecked=0, Total=1406 [2024-11-16 14:56:41,917 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 736 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:56:41,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 387 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 14:56:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2024-11-16 14:56:42,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1116. [2024-11-16 14:56:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 806 states have (on average 1.1575682382133996) internal successors, (933), 816 states have internal predecessors, (933), 236 states have call successors, (236), 73 states have call predecessors, (236), 73 states have return successors, (236), 226 states have call predecessors, (236), 236 states have call successors, (236) [2024-11-16 14:56:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1405 transitions. [2024-11-16 14:56:42,025 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1405 transitions. Word has length 171 [2024-11-16 14:56:42,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:42,026 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1405 transitions. [2024-11-16 14:56:42,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.388888888888889) internal successors, (115), 18 states have internal predecessors, (115), 8 states have call successors, (72), 4 states have call predecessors, (72), 8 states have return successors, (72), 7 states have call predecessors, (72), 8 states have call successors, (72) [2024-11-16 14:56:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1405 transitions. [2024-11-16 14:56:42,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-16 14:56:42,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:42,027 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:42,040 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-16 14:56:42,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:56:42,228 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:42,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:42,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1092422739, now seen corresponding path program 1 times [2024-11-16 14:56:42,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:56:42,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503862132] [2024-11-16 14:56:42,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:56:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 14:56:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2004577931] [2024-11-16 14:56:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:42,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:56:42,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:56:42,277 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:56:42,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 14:56:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:56:42,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 14:56:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:56:42,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 14:56:42,563 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 14:56:42,565 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 14:56:42,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 14:56:42,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:56:42,770 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:56:42,865 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 14:56:42,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:56:42 BoogieIcfgContainer [2024-11-16 14:56:42,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 14:56:42,868 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 14:56:42,868 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 14:56:42,868 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 14:56:42,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:56:03" (3/4) ... [2024-11-16 14:56:42,870 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 14:56:42,870 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 14:56:42,871 INFO L158 Benchmark]: Toolchain (without parser) took 40807.80ms. Allocated memory was 172.0MB in the beginning and 994.1MB in the end (delta: 822.1MB). Free memory was 139.5MB in the beginning and 672.1MB in the end (delta: -532.6MB). Peak memory consumption was 289.0MB. Max. memory is 16.1GB. [2024-11-16 14:56:42,871 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:56:42,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.85ms. Allocated memory is still 172.0MB. Free memory was 139.5MB in the beginning and 122.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 14:56:42,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.24ms. Allocated memory is still 172.0MB. Free memory was 121.2MB in the beginning and 117.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 14:56:42,871 INFO L158 Benchmark]: Boogie Preprocessor took 57.59ms. Allocated memory is still 172.0MB. Free memory was 117.0MB in the beginning and 109.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 14:56:42,871 INFO L158 Benchmark]: IcfgBuilder took 528.01ms. Allocated memory is still 172.0MB. Free memory was 109.7MB in the beginning and 115.0MB in the end (delta: -5.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 14:56:42,872 INFO L158 Benchmark]: TraceAbstraction took 39860.45ms. Allocated memory was 172.0MB in the beginning and 994.1MB in the end (delta: 822.1MB). Free memory was 115.0MB in the beginning and 672.1MB in the end (delta: -557.1MB). Peak memory consumption was 266.0MB. Max. memory is 16.1GB. [2024-11-16 14:56:42,872 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 994.1MB. Free memory is still 672.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:56:42,872 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.85ms. Allocated memory is still 172.0MB. Free memory was 139.5MB in the beginning and 122.2MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.24ms. Allocated memory is still 172.0MB. Free memory was 121.2MB in the beginning and 117.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.59ms. Allocated memory is still 172.0MB. Free memory was 117.0MB in the beginning and 109.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 528.01ms. Allocated memory is still 172.0MB. Free memory was 109.7MB in the beginning and 115.0MB in the end (delta: -5.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 39860.45ms. Allocated memory was 172.0MB in the beginning and 994.1MB in the end (delta: 822.1MB). Free memory was 115.0MB in the beginning and 672.1MB in the end (delta: -557.1MB). Peak memory consumption was 266.0MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 994.1MB. Free memory is still 672.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of bitwiseAnd at line 61, overapproximation of someUnaryDOUBLEoperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryArithmeticFLOAToperation at line 86, overapproximation of someUnaryFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] double var_1_33 = 31.625; [L44] double var_1_36 = 15.75; [L45] double var_1_37 = 15.375; [L46] unsigned short int var_1_38 = 16; [L47] unsigned char var_1_39 = 0; [L48] double var_1_44 = 128.5; [L49] float var_1_45 = 1.85; [L50] double var_1_46 = 1.5; [L51] double var_1_47 = 99999999999.4; [L52] unsigned char var_1_49 = 128; VAL [isInitial=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=0, var_1_8=1, var_1_9=-2] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] FCALL updateLastVariables() [L177] CALL updateVariables() [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_14 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] var_1_15 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] var_1_16 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_18 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] var_1_21 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L145] var_1_23 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L148] var_1_24 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L154] var_1_27 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L161] var_1_46 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L162] RET assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L163] var_1_47 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L164] RET assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L177] RET updateVariables() [L178] CALL step() [L56] var_1_31 = var_1_26 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L57] COND FALSE !(! var_1_7) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L60] var_1_38 = ((((var_1_27) > (var_1_27)) ? (var_1_27) : (var_1_27))) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L61] EXPR var_1_18 & (var_1_29 + 2u) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L61] EXPR 16u >> var_1_26 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L61] COND TRUE (var_1_18 & (var_1_29 + 2u)) < (16u >> var_1_26) [L62] var_1_39 = ((var_1_7 && (var_1_7 && var_1_8)) && (! var_1_23)) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_38=0, var_1_39=1, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L64] COND FALSE !(var_1_36 <= var_1_16) [L69] var_1_44 = var_1_36 VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L71] COND FALSE !((var_1_14 * (var_1_46 - var_1_47)) < var_1_14) [L76] var_1_45 = (((((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) < 0 ) ? -((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))) : ((((((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) < (var_1_37)) ? (((((var_1_14) > (var_1_36)) ? (var_1_14) : (var_1_36)))) : (var_1_37))))) VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] EXPR var_1_18 & var_1_27 VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L78] COND TRUE var_1_20 || (var_1_26 >= (var_1_18 & var_1_27)) [L79] COND FALSE !(-2 > var_1_27) [L82] var_1_49 = var_1_26 VAL [isInitial=1, var_1_13=4997/5, var_1_14=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L85] COND TRUE \read(var_1_8) [L86] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L88] COND TRUE \read(var_1_8) [L89] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L91] var_1_29 = var_1_27 [L92] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=-2] [L93] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L96] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=-10, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L98] var_1_17 = ((var_1_18 - 25) - var_1_25) [L99] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=32741, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L100] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L101] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L105] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=0, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L106] COND FALSE !((~ var_1_29) > stepLocal_3) [L109] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L111] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L112] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L113] COND TRUE stepLocal_1 <= (var_1_25 - var_1_25) VAL [isInitial=1, stepLocal_0=0, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L114] COND FALSE !(stepLocal_0 < var_1_25) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_13=4, var_1_14=0, var_1_16=0, var_1_17=32741, var_1_18=32766, var_1_1=1, var_1_20=0, var_1_21=32765, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=256, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=2, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=2, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.7s, OverallIterations: 20, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5122 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5101 mSDsluCounter, 10040 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7416 mSDsCounter, 1395 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6305 IncrementalHoareTripleChecker+Invalid, 7700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1395 mSolverCounterUnsat, 2624 mSDtfsCounter, 6305 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2299 GetRequests, 1983 SyntacticMatches, 0 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6109 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1601occurred in iteration=14, InterpolantAutomatonStates: 261, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 2868 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 4064 NumberOfCodeBlocks, 4064 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4205 ConstructedInterpolants, 0 QuantifiedInterpolants, 20192 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1197 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 26973/27600 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-16 14:56:43,038 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_fillercodestructure_filler-ps-ci_file-50.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 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:56:44,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:56:44,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 14:56:44,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:56:44,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:56:44,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:56:44,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:56:44,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:56:44,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:56:44,697 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:56:44,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:56:44,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:56:44,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:56:44,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:56:44,698 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:56:44,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:56:44,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:56:44,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:56:44,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:56:44,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:56:44,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:56:44,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:56:44,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:56:44,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 14:56:44,702 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 14:56:44,702 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:56:44,702 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 14:56:44,702 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:56:44,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:56:44,703 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:56:44,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:56:44,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:56:44,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:56:44,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:56:44,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:56:44,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:56:44,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:56:44,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:56:44,704 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 14:56:44,704 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 14:56:44,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:56:44,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:56:44,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:56:44,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:56:44,706 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 -> 6bd3e010bc1161b63e7109d8f2f51cd280074799234e989c902599e5e44de78e [2024-11-16 14:56:44,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:56:44,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:56:44,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:56:44,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:56:44,965 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:56:44,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-11-16 14:56:46,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:56:46,394 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:56:46,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-11-16 14:56:46,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c4f10c0/931b989a658b4c01946e5c16c591ed81/FLAG1d63a4f83 [2024-11-16 14:56:46,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c4f10c0/931b989a658b4c01946e5c16c591ed81 [2024-11-16 14:56:46,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:56:46,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:56:46,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:56:46,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:56:46,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:56:46,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e01b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46, skipping insertion in model container [2024-11-16 14:56:46,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:56:46,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-11-16 14:56:46,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:56:46,669 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:56:46,684 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i[919,932] [2024-11-16 14:56:46,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:56:46,744 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:56:46,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46 WrapperNode [2024-11-16 14:56:46,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:56:46,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:56:46,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:56:46,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:56:46,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,794 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-11-16 14:56:46,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:56:46,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:56:46,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:56:46,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:56:46,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,825 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-16 14:56:46,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:56:46,842 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:56:46,842 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:56:46,842 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:56:46,842 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (1/1) ... [2024-11-16 14:56:46,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:56:46,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:56:46,874 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-16 14:56:46,876 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-16 14:56:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:56:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 14:56:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:56:46,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:56:46,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:56:46,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:56:46,974 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:56:46,976 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:56:57,002 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 14:56:57,003 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:56:57,013 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:56:57,013 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:56:57,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:56:57 BoogieIcfgContainer [2024-11-16 14:56:57,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:56:57,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:56:57,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:56:57,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:56:57,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:56:46" (1/3) ... [2024-11-16 14:56:57,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48006bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:56:57, skipping insertion in model container [2024-11-16 14:56:57,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:56:46" (2/3) ... [2024-11-16 14:56:57,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48006bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:56:57, skipping insertion in model container [2024-11-16 14:56:57,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:56:57" (3/3) ... [2024-11-16 14:56:57,020 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-50.i [2024-11-16 14:56:57,032 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:56:57,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:56:57,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:56:57,088 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;@32d16bdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:56:57,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:56:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:56:57,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 14:56:57,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:57,103 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:57,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:57,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:57,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1045777377, now seen corresponding path program 1 times [2024-11-16 14:56:57,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:56:57,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261672748] [2024-11-16 14:56:57,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:57,120 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-16 14:56:57,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:56:57,124 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-16 14:56:57,125 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-16 14:56:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:57,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 14:56:57,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:56:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-11-16 14:56:57,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:56:57,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:56:57,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261672748] [2024-11-16 14:56:57,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261672748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:56:57,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:56:57,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:56:57,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993871735] [2024-11-16 14:56:57,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:56:57,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:56:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:56:57,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:56:57,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:56:57,695 INFO L87 Difference]: Start difference. First operand has 82 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:56:57,715 INFO L93 Difference]: Finished difference Result 156 states and 265 transitions. [2024-11-16 14:56:57,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:56:57,716 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2024-11-16 14:56:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:56:57,721 INFO L225 Difference]: With dead ends: 156 [2024-11-16 14:56:57,721 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 14:56:57,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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-16 14:56:57,726 INFO L432 NwaCegarLoop]: 115 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, 115 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-16 14:56:57,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:56:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 14:56:57,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-16 14:56:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:56:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-16 14:56:57,757 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 162 [2024-11-16 14:56:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:56:57,757 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-16 14:56:57,757 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, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:56:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-16 14:56:57,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 14:56:57,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:56:57,760 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:56:57,776 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-16 14:56:57,960 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-16 14:56:57,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:56:57,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:56:57,961 INFO L85 PathProgramCache]: Analyzing trace with hash 840679169, now seen corresponding path program 1 times [2024-11-16 14:56:57,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:56:57,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638724010] [2024-11-16 14:56:57,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:56:57,962 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-16 14:56:57,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:56:57,979 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-16 14:56:57,980 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-16 14:56:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:56:58,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 14:56:58,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:56:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 14:56:59,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:57:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:57:00,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:57:00,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638724010] [2024-11-16 14:57:00,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638724010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:57:00,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:57:00,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-16 14:57:00,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489001017] [2024-11-16 14:57:00,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:57:00,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 14:57:00,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:57:00,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 14:57:00,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:57:00,472 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-16 14:57:01,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:57:01,445 INFO L93 Difference]: Finished difference Result 160 states and 235 transitions. [2024-11-16 14:57:01,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 14:57:01,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 162 [2024-11-16 14:57:01,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:57:01,447 INFO L225 Difference]: With dead ends: 160 [2024-11-16 14:57:01,447 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 14:57:01,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-16 14:57:01,449 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 45 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 14:57:01,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 210 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 14:57:01,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 14:57:01,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-16 14:57:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2777777777777777) internal successors, (69), 54 states have internal predecessors, (69), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:57:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-11-16 14:57:01,462 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 162 [2024-11-16 14:57:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:57:01,463 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-11-16 14:57:01,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-16 14:57:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-11-16 14:57:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 14:57:01,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:57:01,465 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:57:01,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 14:57:01,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:57:01,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:57:01,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:57:01,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1052030082, now seen corresponding path program 1 times [2024-11-16 14:57:01,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:57:01,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464434138] [2024-11-16 14:57:01,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:57:01,669 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-16 14:57:01,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:57:01,670 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:57:01,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 14:57:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:57:02,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 14:57:02,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:57:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:57:02,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:57:02,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:57:02,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464434138] [2024-11-16 14:57:02,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464434138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:57:02,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:57:02,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:57:02,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605137465] [2024-11-16 14:57:02,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:57:02,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:57:02,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:57:02,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:57:02,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:57:02,251 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:57:02,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:57:02,510 INFO L93 Difference]: Finished difference Result 222 states and 325 transitions. [2024-11-16 14:57:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:57:02,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-16 14:57:02,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:57:02,513 INFO L225 Difference]: With dead ends: 222 [2024-11-16 14:57:02,513 INFO L226 Difference]: Without dead ends: 144 [2024-11-16 14:57:02,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:57:02,514 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 106 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:57:02,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 489 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:57:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-16 14:57:02,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 81. [2024-11-16 14:57:02,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:57:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2024-11-16 14:57:02,528 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 162 [2024-11-16 14:57:02,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:57:02,528 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2024-11-16 14:57:02,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:57:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2024-11-16 14:57:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 14:57:02,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:57:02,530 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:57:02,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 14:57:02,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:57:02,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:57:02,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:57:02,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1500126879, now seen corresponding path program 1 times [2024-11-16 14:57:02,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:57:02,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267889505] [2024-11-16 14:57:02,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:57:02,732 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-16 14:57:02,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:57:02,734 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-16 14:57:02,735 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-16 14:57:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:57:03,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 14:57:03,146 INFO L278 TraceCheckSpWp]: Computing forward predicates...