./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:11:20,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:11:20,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:11:20,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:11:20,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:11:20,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:11:20,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:11:20,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:11:20,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:11:20,585 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:11:20,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:11:20,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:11:20,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:11:20,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:11:20,587 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:11:20,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:11:20,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:11:20,589 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:11:20,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:11:20,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:11:20,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:11:20,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:11:20,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:11:20,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:11:20,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:11:20,592 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:11:20,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:11:20,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:11:20,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:11:20,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:11:20,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:11:20,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:11:20,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:11:20,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:11:20,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:11:20,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:11:20,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:11:20,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:11:20,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:11:20,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:11:20,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:11:20,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:11:20,596 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-clean/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-clean/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 -> 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 [2024-10-11 07:11:20,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:11:20,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:11:20,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:11:20,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:11:20,830 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:11:20,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i [2024-10-11 07:11:22,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:11:22,204 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:11:22,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i [2024-10-11 07:11:22,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/59c320e1e/f67194b5c62543bfb82ce3cb1b29c791/FLAG2f542a82f [2024-10-11 07:11:22,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/59c320e1e/f67194b5c62543bfb82ce3cb1b29c791 [2024-10-11 07:11:22,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:11:22,233 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:11:22,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:11:22,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:11:22,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:11:22,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ee508a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22, skipping insertion in model container [2024-10-11 07:11:22,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:11:22,424 WARN L248 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_codestructure_dependencies_file-63.i[919,932] [2024-10-11 07:11:22,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:11:22,485 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:11:22,494 WARN L248 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_codestructure_dependencies_file-63.i[919,932] [2024-10-11 07:11:22,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:11:22,532 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:11:22,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22 WrapperNode [2024-10-11 07:11:22,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:11:22,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:11:22,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:11:22,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:11:22,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,588 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-10-11 07:11:22,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:11:22,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:11:22,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:11:22,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:11:22,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,624 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-10-11 07:11:22,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:11:22,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:11:22,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:11:22,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:11:22,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (1/1) ... [2024-10-11 07:11:22,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:11:22,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:11:22,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:11:22,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:11:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:11:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:11:22,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:11:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:11:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:11:22,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:11:22,782 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:11:22,783 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:11:23,062 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 07:11:23,062 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:11:23,095 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:11:23,096 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:11:23,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:11:23 BoogieIcfgContainer [2024-10-11 07:11:23,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:11:23,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:11:23,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:11:23,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:11:23,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:11:22" (1/3) ... [2024-10-11 07:11:23,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402d6ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:11:23, skipping insertion in model container [2024-10-11 07:11:23,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:22" (2/3) ... [2024-10-11 07:11:23,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402d6ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:11:23, skipping insertion in model container [2024-10-11 07:11:23,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:11:23" (3/3) ... [2024-10-11 07:11:23,104 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-63.i [2024-10-11 07:11:23,117 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:11:23,117 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:11:23,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:11:23,172 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;@328d4943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:11:23,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:11:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 07:11:23,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 07:11:23,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:23,185 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:23,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:23,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:23,191 INFO L85 PathProgramCache]: Analyzing trace with hash 904924, now seen corresponding path program 1 times [2024-10-11 07:11:23,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:23,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324783189] [2024-10-11 07:11:23,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:23,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:23,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:23,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324783189] [2024-10-11 07:11:23,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324783189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:23,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:23,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:11:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983086157] [2024-10-11 07:11:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:23,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:11:23,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:23,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:11:23,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:11:23,554 INFO L87 Difference]: Start difference. First operand has 66 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 07:11:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:23,595 INFO L93 Difference]: Finished difference Result 129 states and 214 transitions. [2024-10-11 07:11:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:11:23,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2024-10-11 07:11:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:23,604 INFO L225 Difference]: With dead ends: 129 [2024-10-11 07:11:23,605 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 07:11:23,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-10-11 07:11:23,613 INFO L432 NwaCegarLoop]: 92 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, 92 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-10-11 07:11:23,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:11:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 07:11:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 07:11:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 07:11:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-10-11 07:11:23,654 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 112 [2024-10-11 07:11:23,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:23,655 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-10-11 07:11:23,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 07:11:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-10-11 07:11:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 07:11:23,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:23,658 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:23,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:11:23,659 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1981042600, now seen corresponding path program 1 times [2024-10-11 07:11:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:23,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661837258] [2024-10-11 07:11:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:23,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661837258] [2024-10-11 07:11:23,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661837258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:23,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:23,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:11:23,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925085968] [2024-10-11 07:11:23,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:23,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:11:23,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:23,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:11:23,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:11:23,899 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:23,954 INFO L93 Difference]: Finished difference Result 155 states and 230 transitions. [2024-10-11 07:11:23,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:11:23,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-11 07:11:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:23,956 INFO L225 Difference]: With dead ends: 155 [2024-10-11 07:11:23,957 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 07:11:23,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-10-11 07:11:23,960 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 32 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:23,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 193 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:11:23,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 07:11:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2024-10-11 07:11:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 07:11:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 114 transitions. [2024-10-11 07:11:23,976 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 114 transitions. Word has length 112 [2024-10-11 07:11:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:23,978 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 114 transitions. [2024-10-11 07:11:23,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 114 transitions. [2024-10-11 07:11:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 07:11:23,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:23,981 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:23,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:11:23,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:23,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash -628373656, now seen corresponding path program 1 times [2024-10-11 07:11:23,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:23,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78864124] [2024-10-11 07:11:23,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:24,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:24,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78864124] [2024-10-11 07:11:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78864124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:24,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:24,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:11:24,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767228644] [2024-10-11 07:11:24,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:24,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:11:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:24,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:11:24,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:11:24,543 INFO L87 Difference]: Start difference. First operand 77 states and 114 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:25,204 INFO L93 Difference]: Finished difference Result 391 states and 577 transitions. [2024-10-11 07:11:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:11:25,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-11 07:11:25,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:25,208 INFO L225 Difference]: With dead ends: 391 [2024-10-11 07:11:25,208 INFO L226 Difference]: Without dead ends: 315 [2024-10-11 07:11:25,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:11:25,210 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 273 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:25,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 490 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 07:11:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-11 07:11:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 174. [2024-10-11 07:11:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:11:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 256 transitions. [2024-10-11 07:11:25,235 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 256 transitions. Word has length 112 [2024-10-11 07:11:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:25,235 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 256 transitions. [2024-10-11 07:11:25,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 256 transitions. [2024-10-11 07:11:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 07:11:25,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:25,237 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:25,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:11:25,237 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:25,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1060570086, now seen corresponding path program 1 times [2024-10-11 07:11:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:25,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70574905] [2024-10-11 07:11:25,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:25,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:25,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70574905] [2024-10-11 07:11:25,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70574905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:25,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:25,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:11:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302830718] [2024-10-11 07:11:25,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:25,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:11:25,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:25,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:11:25,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:11:25,507 INFO L87 Difference]: Start difference. First operand 174 states and 256 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:25,711 INFO L93 Difference]: Finished difference Result 475 states and 699 transitions. [2024-10-11 07:11:25,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:11:25,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-10-11 07:11:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:25,714 INFO L225 Difference]: With dead ends: 475 [2024-10-11 07:11:25,715 INFO L226 Difference]: Without dead ends: 399 [2024-10-11 07:11:25,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:11:25,718 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 162 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:25,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 451 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:11:25,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-10-11 07:11:25,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 199. [2024-10-11 07:11:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 164 states have (on average 1.3841463414634145) internal successors, (227), 164 states have internal predecessors, (227), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:11:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2024-10-11 07:11:25,744 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 112 [2024-10-11 07:11:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:25,745 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2024-10-11 07:11:25,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2024-10-11 07:11:25,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 07:11:25,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:25,747 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:25,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:11:25,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:25,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1966077965, now seen corresponding path program 1 times [2024-10-11 07:11:25,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:25,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713866105] [2024-10-11 07:11:25,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:25,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:26,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:26,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713866105] [2024-10-11 07:11:26,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713866105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:26,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:26,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:11:26,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038845589] [2024-10-11 07:11:26,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:26,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:11:26,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:11:26,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:11:26,221 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:27,117 INFO L93 Difference]: Finished difference Result 582 states and 845 transitions. [2024-10-11 07:11:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 07:11:27,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-10-11 07:11:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:27,121 INFO L225 Difference]: With dead ends: 582 [2024-10-11 07:11:27,121 INFO L226 Difference]: Without dead ends: 384 [2024-10-11 07:11:27,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-11 07:11:27,124 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 241 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:27,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 762 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 07:11:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-11 07:11:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 210. [2024-10-11 07:11:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 175 states have (on average 1.3885714285714286) internal successors, (243), 175 states have internal predecessors, (243), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:11:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 307 transitions. [2024-10-11 07:11:27,157 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 307 transitions. Word has length 113 [2024-10-11 07:11:27,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:27,159 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 307 transitions. [2024-10-11 07:11:27,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 307 transitions. [2024-10-11 07:11:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 07:11:27,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:27,160 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:27,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:11:27,161 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:27,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:27,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2146060652, now seen corresponding path program 1 times [2024-10-11 07:11:27,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:27,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964368530] [2024-10-11 07:11:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:27,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:27,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:27,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964368530] [2024-10-11 07:11:27,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964368530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:27,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:27,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:11:27,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424318379] [2024-10-11 07:11:27,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:27,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:11:27,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:27,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:11:27,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:11:27,541 INFO L87 Difference]: Start difference. First operand 210 states and 307 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:27,840 INFO L93 Difference]: Finished difference Result 516 states and 731 transitions. [2024-10-11 07:11:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:11:27,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-10-11 07:11:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:27,842 INFO L225 Difference]: With dead ends: 516 [2024-10-11 07:11:27,842 INFO L226 Difference]: Without dead ends: 307 [2024-10-11 07:11:27,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:11:27,843 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 96 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:27,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 535 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:11:27,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-11 07:11:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 214. [2024-10-11 07:11:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 179 states have (on average 1.324022346368715) internal successors, (237), 179 states have internal predecessors, (237), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:11:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 301 transitions. [2024-10-11 07:11:27,870 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 301 transitions. Word has length 113 [2024-10-11 07:11:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:27,870 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 301 transitions. [2024-10-11 07:11:27,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 301 transitions. [2024-10-11 07:11:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 07:11:27,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:27,872 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:27,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:11:27,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:27,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:27,873 INFO L85 PathProgramCache]: Analyzing trace with hash 718983534, now seen corresponding path program 1 times [2024-10-11 07:11:27,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:27,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033660116] [2024-10-11 07:11:27,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:27,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:27,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:27,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033660116] [2024-10-11 07:11:27,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033660116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:27,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:27,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:11:27,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188304562] [2024-10-11 07:11:27,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:27,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:11:27,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:27,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:11:27,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:11:27,971 INFO L87 Difference]: Start difference. First operand 214 states and 301 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:28,044 INFO L93 Difference]: Finished difference Result 528 states and 745 transitions. [2024-10-11 07:11:28,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:11:28,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-10-11 07:11:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:28,046 INFO L225 Difference]: With dead ends: 528 [2024-10-11 07:11:28,046 INFO L226 Difference]: Without dead ends: 315 [2024-10-11 07:11:28,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-10-11 07:11:28,047 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 70 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:28,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 174 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:11:28,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-11 07:11:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 224. [2024-10-11 07:11:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 189 states have (on average 1.312169312169312) internal successors, (248), 189 states have internal predecessors, (248), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:11:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 312 transitions. [2024-10-11 07:11:28,075 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 312 transitions. Word has length 113 [2024-10-11 07:11:28,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:28,076 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 312 transitions. [2024-10-11 07:11:28,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 312 transitions. [2024-10-11 07:11:28,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 07:11:28,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:28,078 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:28,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:11:28,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:28,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:28,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1148429515, now seen corresponding path program 1 times [2024-10-11 07:11:28,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:28,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554496641] [2024-10-11 07:11:28,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:28,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:28,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:28,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554496641] [2024-10-11 07:11:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554496641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:28,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:11:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893920691] [2024-10-11 07:11:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:28,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:11:28,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:28,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:11:28,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:11:28,308 INFO L87 Difference]: Start difference. First operand 224 states and 312 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:28,534 INFO L93 Difference]: Finished difference Result 443 states and 618 transitions. [2024-10-11 07:11:28,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:11:28,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-10-11 07:11:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:28,537 INFO L225 Difference]: With dead ends: 443 [2024-10-11 07:11:28,537 INFO L226 Difference]: Without dead ends: 328 [2024-10-11 07:11:28,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:11:28,538 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 72 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:28,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 529 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:11:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-11 07:11:28,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 229. [2024-10-11 07:11:28,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 194 states have (on average 1.309278350515464) internal successors, (254), 194 states have internal predecessors, (254), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:11:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 318 transitions. [2024-10-11 07:11:28,562 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 318 transitions. Word has length 113 [2024-10-11 07:11:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:28,562 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 318 transitions. [2024-10-11 07:11:28,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 318 transitions. [2024-10-11 07:11:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 07:11:28,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:28,563 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:28,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:11:28,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:28,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1440694808, now seen corresponding path program 1 times [2024-10-11 07:11:28,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:28,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301757151] [2024-10-11 07:11:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:28,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:28,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:28,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301757151] [2024-10-11 07:11:28,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301757151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:28,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:28,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:11:28,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41140272] [2024-10-11 07:11:28,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:28,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:11:28,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:28,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:11:28,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:11:28,881 INFO L87 Difference]: Start difference. First operand 229 states and 318 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:29,388 INFO L93 Difference]: Finished difference Result 557 states and 772 transitions. [2024-10-11 07:11:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:11:29,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-11 07:11:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:29,390 INFO L225 Difference]: With dead ends: 557 [2024-10-11 07:11:29,390 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 07:11:29,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:11:29,393 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 164 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:29,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 653 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 07:11:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 07:11:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 237. [2024-10-11 07:11:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 202 states have (on average 1.301980198019802) internal successors, (263), 202 states have internal predecessors, (263), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:11:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 327 transitions. [2024-10-11 07:11:29,420 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 327 transitions. Word has length 114 [2024-10-11 07:11:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:29,420 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 327 transitions. [2024-10-11 07:11:29,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 327 transitions. [2024-10-11 07:11:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 07:11:29,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:29,421 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:29,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 07:11:29,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:29,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:29,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1482869721, now seen corresponding path program 1 times [2024-10-11 07:11:29,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:29,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796770670] [2024-10-11 07:11:29,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:29,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:29,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796770670] [2024-10-11 07:11:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796770670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:29,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:29,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:11:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815159848] [2024-10-11 07:11:29,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:29,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:11:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:11:29,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:11:29,629 INFO L87 Difference]: Start difference. First operand 237 states and 327 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:29,865 INFO L93 Difference]: Finished difference Result 501 states and 696 transitions. [2024-10-11 07:11:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:11:29,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-11 07:11:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:29,868 INFO L225 Difference]: With dead ends: 501 [2024-10-11 07:11:29,868 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 07:11:29,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:11:29,869 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 117 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:29,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 321 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:11:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 07:11:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 223. [2024-10-11 07:11:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 188 states have (on average 1.2925531914893618) internal successors, (243), 188 states have internal predecessors, (243), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:11:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 307 transitions. [2024-10-11 07:11:29,892 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 307 transitions. Word has length 114 [2024-10-11 07:11:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:29,894 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 307 transitions. [2024-10-11 07:11:29,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 307 transitions. [2024-10-11 07:11:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 07:11:29,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:29,896 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:29,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 07:11:29,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:29,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:29,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2134028121, now seen corresponding path program 1 times [2024-10-11 07:11:29,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:29,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236458883] [2024-10-11 07:11:29,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:29,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:30,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:30,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236458883] [2024-10-11 07:11:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236458883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:30,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:30,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:11:30,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677024237] [2024-10-11 07:11:30,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:30,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:11:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:30,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:11:30,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:11:30,297 INFO L87 Difference]: Start difference. First operand 223 states and 307 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:30,548 INFO L93 Difference]: Finished difference Result 442 states and 588 transitions. [2024-10-11 07:11:30,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:11:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-11 07:11:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:30,550 INFO L225 Difference]: With dead ends: 442 [2024-10-11 07:11:30,550 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 07:11:30,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:11:30,551 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 87 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:30,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 405 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:11:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 07:11:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 221. [2024-10-11 07:11:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 186 states have (on average 1.2903225806451613) internal successors, (240), 186 states have internal predecessors, (240), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:11:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 304 transitions. [2024-10-11 07:11:30,572 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 304 transitions. Word has length 114 [2024-10-11 07:11:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:30,572 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 304 transitions. [2024-10-11 07:11:30,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 304 transitions. [2024-10-11 07:11:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 07:11:30,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:30,573 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:30,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 07:11:30,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:30,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash -485453184, now seen corresponding path program 1 times [2024-10-11 07:11:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681102021] [2024-10-11 07:11:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:30,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:30,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681102021] [2024-10-11 07:11:30,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681102021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:30,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:30,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:11:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764053244] [2024-10-11 07:11:30,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:30,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:11:30,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:30,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:11:30,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:11:30,641 INFO L87 Difference]: Start difference. First operand 221 states and 304 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:30,706 INFO L93 Difference]: Finished difference Result 526 states and 728 transitions. [2024-10-11 07:11:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:11:30,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-11 07:11:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:30,708 INFO L225 Difference]: With dead ends: 526 [2024-10-11 07:11:30,708 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 07:11:30,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-10-11 07:11:30,709 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 64 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:30,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 222 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:11:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 07:11:30,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 219. [2024-10-11 07:11:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 184 states have (on average 1.2717391304347827) internal successors, (234), 184 states have internal predecessors, (234), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:11:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 298 transitions. [2024-10-11 07:11:30,749 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 298 transitions. Word has length 114 [2024-10-11 07:11:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:30,749 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 298 transitions. [2024-10-11 07:11:30,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 298 transitions. [2024-10-11 07:11:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 07:11:30,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:30,751 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:30,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 07:11:30,751 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:30,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1863396634, now seen corresponding path program 1 times [2024-10-11 07:11:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:30,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047238763] [2024-10-11 07:11:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:30,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:30,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:30,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047238763] [2024-10-11 07:11:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047238763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:30,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:30,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:11:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538665045] [2024-10-11 07:11:30,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:30,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:11:30,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:30,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:11:30,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:11:30,959 INFO L87 Difference]: Start difference. First operand 219 states and 298 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:31,259 INFO L93 Difference]: Finished difference Result 477 states and 657 transitions. [2024-10-11 07:11:31,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:11:31,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-11 07:11:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:31,262 INFO L225 Difference]: With dead ends: 477 [2024-10-11 07:11:31,262 INFO L226 Difference]: Without dead ends: 360 [2024-10-11 07:11:31,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:11:31,263 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 152 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:31,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 729 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:11:31,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-11 07:11:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 227. [2024-10-11 07:11:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 192 states have (on average 1.2760416666666667) internal successors, (245), 192 states have internal predecessors, (245), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:11:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 309 transitions. [2024-10-11 07:11:31,290 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 309 transitions. Word has length 114 [2024-10-11 07:11:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:31,290 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 309 transitions. [2024-10-11 07:11:31,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 309 transitions. [2024-10-11 07:11:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 07:11:31,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:31,292 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:31,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 07:11:31,292 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:31,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1905571547, now seen corresponding path program 1 times [2024-10-11 07:11:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032093654] [2024-10-11 07:11:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:33,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:33,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:33,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032093654] [2024-10-11 07:11:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032093654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:33,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:33,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 07:11:33,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84457816] [2024-10-11 07:11:33,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:33,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:11:33,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:33,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:11:33,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:11:33,373 INFO L87 Difference]: Start difference. First operand 227 states and 309 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:34,851 INFO L93 Difference]: Finished difference Result 503 states and 667 transitions. [2024-10-11 07:11:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 07:11:34,852 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-10-11 07:11:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:34,853 INFO L225 Difference]: With dead ends: 503 [2024-10-11 07:11:34,853 INFO L226 Difference]: Without dead ends: 378 [2024-10-11 07:11:34,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2024-10-11 07:11:34,854 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 234 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:34,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 477 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 07:11:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-11 07:11:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 324. [2024-10-11 07:11:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 286 states have (on average 1.2902097902097902) internal successors, (369), 287 states have internal predecessors, (369), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:11:34,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 437 transitions. [2024-10-11 07:11:34,879 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 437 transitions. Word has length 114 [2024-10-11 07:11:34,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:34,879 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 437 transitions. [2024-10-11 07:11:34,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 437 transitions. [2024-10-11 07:11:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 07:11:34,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:34,881 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:34,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 07:11:34,881 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:34,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:34,882 INFO L85 PathProgramCache]: Analyzing trace with hash 29846264, now seen corresponding path program 1 times [2024-10-11 07:11:34,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:34,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128903462] [2024-10-11 07:11:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:34,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:34,932 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:34,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:34,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128903462] [2024-10-11 07:11:34,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128903462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:34,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:34,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:11:34,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832983442] [2024-10-11 07:11:34,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:34,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:11:34,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:34,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:11:34,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:11:34,934 INFO L87 Difference]: Start difference. First operand 324 states and 437 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:34,995 INFO L93 Difference]: Finished difference Result 752 states and 1016 transitions. [2024-10-11 07:11:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:11:34,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-10-11 07:11:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:34,998 INFO L225 Difference]: With dead ends: 752 [2024-10-11 07:11:34,998 INFO L226 Difference]: Without dead ends: 429 [2024-10-11 07:11:34,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-10-11 07:11:34,999 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 79 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:34,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 172 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:11:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-11 07:11:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 324. [2024-10-11 07:11:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 286 states have (on average 1.2797202797202798) internal successors, (366), 287 states have internal predecessors, (366), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:11:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 434 transitions. [2024-10-11 07:11:35,025 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 434 transitions. Word has length 115 [2024-10-11 07:11:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:35,025 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 434 transitions. [2024-10-11 07:11:35,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 434 transitions. [2024-10-11 07:11:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 07:11:35,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:35,027 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:35,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 07:11:35,027 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:35,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash -851393996, now seen corresponding path program 1 times [2024-10-11 07:11:35,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:35,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308493366] [2024-10-11 07:11:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:35,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308493366] [2024-10-11 07:11:35,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308493366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:35,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:35,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:11:35,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220552046] [2024-10-11 07:11:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:35,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:11:35,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:35,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:11:35,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:11:35,086 INFO L87 Difference]: Start difference. First operand 324 states and 434 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:35,166 INFO L93 Difference]: Finished difference Result 879 states and 1187 transitions. [2024-10-11 07:11:35,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:11:35,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-10-11 07:11:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:35,169 INFO L225 Difference]: With dead ends: 879 [2024-10-11 07:11:35,169 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 07:11:35,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-10-11 07:11:35,170 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 88 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:35,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 149 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:11:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 07:11:35,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 330. [2024-10-11 07:11:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 292 states have (on average 1.273972602739726) internal successors, (372), 293 states have internal predecessors, (372), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:11:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 440 transitions. [2024-10-11 07:11:35,199 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 440 transitions. Word has length 115 [2024-10-11 07:11:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:35,199 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 440 transitions. [2024-10-11 07:11:35,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 440 transitions. [2024-10-11 07:11:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 07:11:35,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:35,201 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:35,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 07:11:35,201 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:35,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:35,201 INFO L85 PathProgramCache]: Analyzing trace with hash -150329418, now seen corresponding path program 1 times [2024-10-11 07:11:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:35,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390013424] [2024-10-11 07:11:35,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:35,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:35,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390013424] [2024-10-11 07:11:35,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390013424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:35,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:35,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:11:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657465851] [2024-10-11 07:11:35,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:35,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:11:35,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:11:35,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:11:35,452 INFO L87 Difference]: Start difference. First operand 330 states and 440 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:35,728 INFO L93 Difference]: Finished difference Result 738 states and 948 transitions. [2024-10-11 07:11:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:11:35,728 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-10-11 07:11:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:35,730 INFO L225 Difference]: With dead ends: 738 [2024-10-11 07:11:35,730 INFO L226 Difference]: Without dead ends: 512 [2024-10-11 07:11:35,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:11:35,731 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 65 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:35,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 573 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:11:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-10-11 07:11:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 328. [2024-10-11 07:11:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 290 states have (on average 1.2758620689655173) internal successors, (370), 291 states have internal predecessors, (370), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:11:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 438 transitions. [2024-10-11 07:11:35,775 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 438 transitions. Word has length 115 [2024-10-11 07:11:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:35,776 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 438 transitions. [2024-10-11 07:11:35,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 438 transitions. [2024-10-11 07:11:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 07:11:35,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:35,777 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:35,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 07:11:35,777 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:35,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1134824103, now seen corresponding path program 1 times [2024-10-11 07:11:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:35,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293944372] [2024-10-11 07:11:35,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:36,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293944372] [2024-10-11 07:11:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293944372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:36,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:36,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:11:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786265887] [2024-10-11 07:11:36,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:36,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:11:36,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:36,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:11:36,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:11:36,088 INFO L87 Difference]: Start difference. First operand 328 states and 438 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:36,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:36,213 INFO L93 Difference]: Finished difference Result 555 states and 738 transitions. [2024-10-11 07:11:36,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:11:36,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-10-11 07:11:36,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:36,215 INFO L225 Difference]: With dead ends: 555 [2024-10-11 07:11:36,215 INFO L226 Difference]: Without dead ends: 331 [2024-10-11 07:11:36,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:11:36,216 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 93 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:36,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 289 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:11:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-11 07:11:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 328. [2024-10-11 07:11:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 290 states have (on average 1.2689655172413794) internal successors, (368), 291 states have internal predecessors, (368), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:11:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 436 transitions. [2024-10-11 07:11:36,244 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 436 transitions. Word has length 115 [2024-10-11 07:11:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:36,244 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 436 transitions. [2024-10-11 07:11:36,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 436 transitions. [2024-10-11 07:11:36,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 07:11:36,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:36,245 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:36,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 07:11:36,246 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:36,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:36,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2139074839, now seen corresponding path program 1 times [2024-10-11 07:11:36,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:36,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473617962] [2024-10-11 07:11:36,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:36,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:36,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:36,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473617962] [2024-10-11 07:11:36,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473617962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:36,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:36,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:11:36,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592063886] [2024-10-11 07:11:36,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:36,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:11:36,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:36,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:11:36,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:11:36,970 INFO L87 Difference]: Start difference. First operand 328 states and 436 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:37,505 INFO L93 Difference]: Finished difference Result 563 states and 743 transitions. [2024-10-11 07:11:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:11:37,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-10-11 07:11:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:37,507 INFO L225 Difference]: With dead ends: 563 [2024-10-11 07:11:37,507 INFO L226 Difference]: Without dead ends: 339 [2024-10-11 07:11:37,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:11:37,508 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 194 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:37,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 561 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:11:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-11 07:11:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 322. [2024-10-11 07:11:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 284 states have (on average 1.267605633802817) internal successors, (360), 285 states have internal predecessors, (360), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:11:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 428 transitions. [2024-10-11 07:11:37,537 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 428 transitions. Word has length 115 [2024-10-11 07:11:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:37,537 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 428 transitions. [2024-10-11 07:11:37,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 428 transitions. [2024-10-11 07:11:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 07:11:37,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:37,538 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:37,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 07:11:37,539 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:37,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash 941283782, now seen corresponding path program 1 times [2024-10-11 07:11:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:37,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695138377] [2024-10-11 07:11:37,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:37,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:11:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:11:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:11:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:11:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:11:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:11:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 07:11:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 07:11:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 07:11:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 07:11:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 07:11:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 07:11:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:37,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:37,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695138377] [2024-10-11 07:11:37,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695138377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:37,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:37,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:11:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003731452] [2024-10-11 07:11:37,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:37,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:11:37,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:11:37,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:11:37,782 INFO L87 Difference]: Start difference. First operand 322 states and 428 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:38,219 INFO L93 Difference]: Finished difference Result 738 states and 949 transitions. [2024-10-11 07:11:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:11:38,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-10-11 07:11:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:38,221 INFO L225 Difference]: With dead ends: 738 [2024-10-11 07:11:38,221 INFO L226 Difference]: Without dead ends: 520 [2024-10-11 07:11:38,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:11:38,222 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 177 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:38,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 658 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:11:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2024-10-11 07:11:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 329. [2024-10-11 07:11:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 291 states have (on average 1.268041237113402) internal successors, (369), 292 states have internal predecessors, (369), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 07:11:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 437 transitions. [2024-10-11 07:11:38,253 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 437 transitions. Word has length 115 [2024-10-11 07:11:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:38,254 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 437 transitions. [2024-10-11 07:11:38,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 437 transitions. [2024-10-11 07:11:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 07:11:38,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:38,255 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:38,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 07:11:38,255 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:38,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:38,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1883080787, now seen corresponding path program 1 times [2024-10-11 07:11:38,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:38,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507160536] [2024-10-11 07:11:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:11:38,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:11:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:11:38,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:11:38,325 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:11:38,326 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:11:38,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 07:11:38,331 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, 1] [2024-10-11 07:11:38,403 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:11:38,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:11:38 BoogieIcfgContainer [2024-10-11 07:11:38,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:11:38,407 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:11:38,407 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:11:38,407 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:11:38,408 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:11:23" (3/4) ... [2024-10-11 07:11:38,409 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:11:38,410 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:11:38,411 INFO L158 Benchmark]: Toolchain (without parser) took 16177.63ms. Allocated memory was 182.5MB in the beginning and 539.0MB in the end (delta: 356.5MB). Free memory was 114.7MB in the beginning and 395.7MB in the end (delta: -281.0MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2024-10-11 07:11:38,411 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:11:38,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.10ms. Allocated memory is still 182.5MB. Free memory was 114.5MB in the beginning and 146.4MB in the end (delta: -31.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-10-11 07:11:38,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.94ms. Allocated memory is still 182.5MB. Free memory was 146.4MB in the beginning and 143.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:11:38,411 INFO L158 Benchmark]: Boogie Preprocessor took 50.09ms. Allocated memory is still 182.5MB. Free memory was 143.4MB in the beginning and 138.0MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 07:11:38,414 INFO L158 Benchmark]: RCFGBuilder took 456.78ms. Allocated memory is still 182.5MB. Free memory was 138.0MB in the beginning and 110.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 07:11:38,414 INFO L158 Benchmark]: TraceAbstraction took 15308.83ms. Allocated memory was 182.5MB in the beginning and 539.0MB in the end (delta: 356.5MB). Free memory was 110.7MB in the beginning and 396.7MB in the end (delta: -286.0MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2024-10-11 07:11:38,415 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 539.0MB. Free memory was 396.7MB in the beginning and 395.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:11:38,415 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.10ms. Allocated memory is still 182.5MB. Free memory is still 140.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.10ms. Allocated memory is still 182.5MB. Free memory was 114.5MB in the beginning and 146.4MB in the end (delta: -31.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.94ms. Allocated memory is still 182.5MB. Free memory was 146.4MB in the beginning and 143.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.09ms. Allocated memory is still 182.5MB. Free memory was 143.4MB in the beginning and 138.0MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 456.78ms. Allocated memory is still 182.5MB. Free memory was 138.0MB in the beginning and 110.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15308.83ms. Allocated memory was 182.5MB in the beginning and 539.0MB in the end (delta: 356.5MB). Free memory was 110.7MB in the beginning and 396.7MB in the end (delta: -286.0MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 539.0MB. Free memory was 396.7MB in the beginning and 395.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_13 = var_1_13 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L88] var_1_7 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L89] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L90] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L90] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L91] var_1_15 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_16 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_18 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] var_1_19 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] var_1_20 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] var_1_21 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] var_1_22 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] var_1_23 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] var_1_27 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_28 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L129] RET updateVariables() [L130] CALL step() [L48] COND FALSE !(last_1_var_1_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L51] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L52] COND FALSE !(\read(var_1_7)) [L55] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L57] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L60] var_1_32 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L61] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L61] COND TRUE (var_1_32 >> var_1_32) < var_1_13 [L62] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=0, var_1_7=0] [L64] var_1_30 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L65] COND TRUE var_1_11 >= var_1_30 [L66] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L68] COND TRUE ! var_1_7 [L69] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L77] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L77] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L78] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L121-L122] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2460 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2460 mSDsluCounter, 8435 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5774 mSDsCounter, 474 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4642 IncrementalHoareTripleChecker+Invalid, 5116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 474 mSolverCounterUnsat, 2661 mSDtfsCounter, 4642 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 857 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=16, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 2048 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2390 NumberOfCodeBlocks, 2390 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2254 ConstructedInterpolants, 0 QuantifiedInterpolants, 10446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 9600/9600 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-10-11 07:11:38,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:11:40,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:11:40,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:11:40,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:11:40,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:11:40,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:11:40,402 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:11:40,402 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:11:40,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:11:40,403 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:11:40,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:11:40,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:11:40,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:11:40,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:11:40,405 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:11:40,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:11:40,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:11:40,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:11:40,407 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:11:40,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:11:40,407 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:11:40,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:11:40,408 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:11:40,408 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:11:40,408 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:11:40,409 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:11:40,409 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:11:40,409 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:11:40,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:11:40,409 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:11:40,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:11:40,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:11:40,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:11:40,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:11:40,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:11:40,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:11:40,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:11:40,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:11:40,418 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:11:40,419 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:11:40,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:11:40,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:11:40,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:11:40,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:11:40,421 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:11:40,421 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-clean/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-clean/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 -> 98d888997158447b2a3898a53afaa14cf68ee37a80eaa35550740ccfab812c92 [2024-10-11 07:11:40,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:11:40,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:11:40,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:11:40,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:11:40,678 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:11:40,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i [2024-10-11 07:11:41,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:11:42,114 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:11:42,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-63.i [2024-10-11 07:11:42,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/45fa7a138/a9cbfbda99ed48b49fc92d6b830edf77/FLAG7d7dc1194 [2024-10-11 07:11:42,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/45fa7a138/a9cbfbda99ed48b49fc92d6b830edf77 [2024-10-11 07:11:42,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:11:42,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:11:42,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:11:42,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:11:42,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:11:42,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7719b1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42, skipping insertion in model container [2024-10-11 07:11:42,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:11:42,700 WARN L248 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_codestructure_dependencies_file-63.i[919,932] [2024-10-11 07:11:42,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:11:42,774 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:11:42,785 WARN L248 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_codestructure_dependencies_file-63.i[919,932] [2024-10-11 07:11:42,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:11:42,835 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:11:42,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42 WrapperNode [2024-10-11 07:11:42,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:11:42,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:11:42,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:11:42,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:11:42,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,882 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-10-11 07:11:42,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:11:42,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:11:42,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:11:42,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:11:42,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,917 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-10-11 07:11:42,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:11:42,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:11:42,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:11:42,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:11:42,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (1/1) ... [2024-10-11 07:11:42,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:11:42,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:11:42,979 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:11:42,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:11:43,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:11:43,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:11:43,016 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:11:43,017 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:11:43,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:11:43,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:11:43,095 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:11:43,097 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:11:47,109 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:11:47,110 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:11:47,167 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:11:47,168 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:11:47,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:11:47 BoogieIcfgContainer [2024-10-11 07:11:47,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:11:47,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:11:47,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:11:47,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:11:47,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:11:42" (1/3) ... [2024-10-11 07:11:47,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5023e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:11:47, skipping insertion in model container [2024-10-11 07:11:47,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:11:42" (2/3) ... [2024-10-11 07:11:47,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5023e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:11:47, skipping insertion in model container [2024-10-11 07:11:47,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:11:47" (3/3) ... [2024-10-11 07:11:47,177 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-63.i [2024-10-11 07:11:47,190 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:11:47,190 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:11:47,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:11:47,252 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;@3a83b5ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:11:47,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:11:47,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 07:11:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 07:11:47,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:47,272 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:47,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:47,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1818009227, now seen corresponding path program 1 times [2024-10-11 07:11:47,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:11:47,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062318708] [2024-10-11 07:11:47,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:47,286 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-10-11 07:11:47,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:11:47,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 07:11:47,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:11:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:47,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:11:47,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:11:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-11 07:11:47,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:11:47,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:11:47,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062318708] [2024-10-11 07:11:47,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062318708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:47,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:11:47,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581021096] [2024-10-11 07:11:47,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:47,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:11:47,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:11:47,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:11:47,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:11:47,679 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 07:11:51,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:11:51,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:51,579 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-10-11 07:11:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:11:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 106 [2024-10-11 07:11:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:51,609 INFO L225 Difference]: With dead ends: 101 [2024-10-11 07:11:51,609 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 07:11:51,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 105 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-10-11 07:11:51,613 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:51,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 07:11:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 07:11:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 07:11:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 07:11:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-10-11 07:11:51,642 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 106 [2024-10-11 07:11:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:51,642 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-10-11 07:11:51,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 07:11:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-10-11 07:11:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 07:11:51,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:51,655 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:51,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 07:11:51,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 07:11:51,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:51,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2041141161, now seen corresponding path program 1 times [2024-10-11 07:11:51,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:11:51,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714095874] [2024-10-11 07:11:51,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:51,858 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-10-11 07:11:51,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:11:51,860 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 07:11:51,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:11:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:52,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:11:52,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:11:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 07:11:52,209 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:11:52,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:11:52,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714095874] [2024-10-11 07:11:52,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714095874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:52,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:52,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:11:52,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842769389] [2024-10-11 07:11:52,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:52,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:11:52,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:11:52,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:11:52,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:11:52,212 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:54,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:11:55,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:11:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:56,039 INFO L93 Difference]: Finished difference Result 113 states and 167 transitions. [2024-10-11 07:11:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:11:56,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 106 [2024-10-11 07:11:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:56,044 INFO L225 Difference]: With dead ends: 113 [2024-10-11 07:11:56,045 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 07:11:56,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 104 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-10-11 07:11:56,047 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:56,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 134 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 07:11:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 07:11:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2024-10-11 07:11:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 07:11:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-10-11 07:11:56,059 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 106 [2024-10-11 07:11:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:56,060 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-10-11 07:11:56,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 07:11:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-10-11 07:11:56,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 07:11:56,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:56,062 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 07:11:56,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:11:56,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 07:11:56,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:56,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1733103593, now seen corresponding path program 1 times [2024-10-11 07:11:56,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:11:56,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299089251] [2024-10-11 07:11:56,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:56,264 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-10-11 07:11:56,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:11:56,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 07:11:56,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 07:11:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:56,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 07:11:56,573 INFO L278 TraceCheckSpWp]: Computing forward predicates...