./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:47:51,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:47:51,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:47:51,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:47:51,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:47:51,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:47:51,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:47:51,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:47:51,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:47:51,993 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:47:51,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:47:51,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:47:51,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:47:51,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:47:51,995 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:47:51,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:47:51,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:47:51,998 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:47:51,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:47:51,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:47:51,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:47:52,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:47:52,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:47:52,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:47:52,002 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:47:52,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:47:52,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:47:52,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:47:52,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:47:52,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:47:52,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:47:52,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:47:52,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:47:52,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:47:52,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:47:52,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:47:52,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:47:52,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:47:52,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:47:52,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:47:52,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:47:52,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:47:52,008 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d [2024-11-12 05:47:52,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:47:52,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:47:52,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:47:52,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:47:52,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:47:52,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-12 05:47:53,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:47:54,038 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:47:54,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-12 05:47:54,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ef560e2/cf2b0a3c36914affa55e0d5418ef5288/FLAG1515b7a80 [2024-11-12 05:47:54,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39ef560e2/cf2b0a3c36914affa55e0d5418ef5288 [2024-11-12 05:47:54,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:47:54,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:47:54,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:47:54,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:47:54,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:47:54,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afe105a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54, skipping insertion in model container [2024-11-12 05:47:54,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:47:54,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-11-12 05:47:54,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:47:54,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:47:54,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-11-12 05:47:54,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:47:54,454 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:47:54,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54 WrapperNode [2024-11-12 05:47:54,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:47:54,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:47:54,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:47:54,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:47:54,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,513 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-12 05:47:54,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:47:54,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:47:54,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:47:54,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:47:54,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,557 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:47:54,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:47:54,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:47:54,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:47:54,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:47:54,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (1/1) ... [2024-11-12 05:47:54,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:47:54,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:47:54,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:47:54,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:47:54,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:47:54,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:47:54,680 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:47:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:47:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:47:54,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:47:54,769 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:47:54,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:47:55,181 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-12 05:47:55,182 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:47:55,199 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:47:55,200 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:47:55,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:47:55 BoogieIcfgContainer [2024-11-12 05:47:55,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:47:55,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:47:55,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:47:55,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:47:55,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:47:54" (1/3) ... [2024-11-12 05:47:55,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589ab813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:47:55, skipping insertion in model container [2024-11-12 05:47:55,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:47:54" (2/3) ... [2024-11-12 05:47:55,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589ab813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:47:55, skipping insertion in model container [2024-11-12 05:47:55,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:47:55" (3/3) ... [2024-11-12 05:47:55,211 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-12 05:47:55,227 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:47:55,227 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:47:55,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:47:55,309 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;@3a28ae1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:47:55,310 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:47:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:47:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 05:47:55,330 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:47:55,331 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:47:55,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:47:55,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:47:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1790269358, now seen corresponding path program 1 times [2024-11-12 05:47:55,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:47:55,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548377872] [2024-11-12 05:47:55,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:47:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:47:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:47:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:47:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:47:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:47:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:47:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:47:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:47:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:47:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:47:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:47:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:47:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:47:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:47:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:47:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:47:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:55,768 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:47:55,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:47:55,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548377872] [2024-11-12 05:47:55,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548377872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:47:55,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:47:55,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:47:55,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023412924] [2024-11-12 05:47:55,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:47:55,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:47:55,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:47:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:47:55,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:47:55,806 INFO L87 Difference]: Start difference. First operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:47:55,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:47:55,840 INFO L93 Difference]: Finished difference Result 147 states and 232 transitions. [2024-11-12 05:47:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:47:55,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-12 05:47:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:47:55,849 INFO L225 Difference]: With dead ends: 147 [2024-11-12 05:47:55,849 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 05:47:55,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:47:55,859 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:47:55,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:47:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 05:47:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-12 05:47:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:47:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-11-12 05:47:55,911 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 108 [2024-11-12 05:47:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:47:55,913 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-11-12 05:47:55,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:47:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-12 05:47:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-12 05:47:55,919 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:47:55,919 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:47:55,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:47:55,920 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:47:55,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:47:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1370819596, now seen corresponding path program 1 times [2024-11-12 05:47:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:47:55,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263177199] [2024-11-12 05:47:55,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:47:55,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:47:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:47:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:47:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:47:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:47:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:47:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:47:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:47:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:47:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:47:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:47:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:47:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:47:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:47:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:47:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:47:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:47:56,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:47:56,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263177199] [2024-11-12 05:47:56,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263177199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:47:56,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:47:56,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:47:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876002562] [2024-11-12 05:47:56,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:47:56,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:47:56,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:47:56,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:47:56,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:47:56,306 INFO L87 Difference]: Start difference. First operand 71 states and 103 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:47:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:47:56,333 INFO L93 Difference]: Finished difference Result 140 states and 205 transitions. [2024-11-12 05:47:56,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:47:56,335 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-12 05:47:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:47:56,337 INFO L225 Difference]: With dead ends: 140 [2024-11-12 05:47:56,337 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 05:47:56,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:47:56,340 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:47:56,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:47:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 05:47:56,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 05:47:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:47:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2024-11-12 05:47:56,353 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 108 [2024-11-12 05:47:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:47:56,355 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2024-11-12 05:47:56,355 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:47:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2024-11-12 05:47:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 05:47:56,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:47:56,357 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:47:56,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:47:56,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:47:56,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:47:56,358 INFO L85 PathProgramCache]: Analyzing trace with hash -391400944, now seen corresponding path program 1 times [2024-11-12 05:47:56,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:47:56,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757511814] [2024-11-12 05:47:56,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:47:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:47:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:47:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:47:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:47:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:47:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:47:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:47:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:47:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:47:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:47:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:47:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:47:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:47:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:47:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:47:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:47:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:47:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:47:58,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:47:58,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757511814] [2024-11-12 05:47:58,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757511814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:47:58,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:47:58,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 05:47:58,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453270466] [2024-11-12 05:47:58,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:47:58,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:47:58,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:47:58,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:47:58,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:47:58,655 INFO L87 Difference]: Start difference. First operand 72 states and 104 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:47:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:47:59,077 INFO L93 Difference]: Finished difference Result 182 states and 263 transitions. [2024-11-12 05:47:59,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 05:47:59,079 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-12 05:47:59,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:47:59,081 INFO L225 Difference]: With dead ends: 182 [2024-11-12 05:47:59,081 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 05:47:59,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:47:59,083 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 137 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:47:59,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 365 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:47:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 05:47:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2024-11-12 05:47:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:47:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-11-12 05:47:59,094 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 109 [2024-11-12 05:47:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:47:59,095 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-11-12 05:47:59,095 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:47:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-11-12 05:47:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 05:47:59,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:47:59,097 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:47:59,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:47:59,097 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:47:59,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:47:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2080344686, now seen corresponding path program 1 times [2024-11-12 05:47:59,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:47:59,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391510122] [2024-11-12 05:47:59,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:47:59,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:47:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:48:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:48:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:48:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:48:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:48:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:48:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:48:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:48:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:48:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:48:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:48:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:48:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:48:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:48:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:48:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:48:02,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:02,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391510122] [2024-11-12 05:48:02,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391510122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:48:02,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:48:02,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 05:48:02,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015995368] [2024-11-12 05:48:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:48:02,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 05:48:02,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 05:48:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:48:02,727 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:48:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:06,310 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2024-11-12 05:48:06,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 05:48:06,312 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2024-11-12 05:48:06,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:06,314 INFO L225 Difference]: With dead ends: 304 [2024-11-12 05:48:06,314 INFO L226 Difference]: Without dead ends: 211 [2024-11-12 05:48:06,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-12 05:48:06,320 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 425 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:06,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 376 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-12 05:48:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-12 05:48:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 103. [2024-11-12 05:48:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:48:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-11-12 05:48:06,346 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 109 [2024-11-12 05:48:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:06,347 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-11-12 05:48:06,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:48:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-11-12 05:48:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 05:48:06,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:06,349 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:06,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:48:06,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:06,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1193554256, now seen corresponding path program 1 times [2024-11-12 05:48:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:06,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546291307] [2024-11-12 05:48:06,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:06,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:48:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:48:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:48:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:48:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:48:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:48:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:48:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:48:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:48:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:48:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:48:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:48:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:48:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:48:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:48:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:08,073 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:48:08,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546291307] [2024-11-12 05:48:08,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546291307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:48:08,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:48:08,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 05:48:08,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436060734] [2024-11-12 05:48:08,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:48:08,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:48:08,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:08,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:48:08,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:48:08,079 INFO L87 Difference]: Start difference. First operand 103 states and 152 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:08,671 INFO L93 Difference]: Finished difference Result 297 states and 435 transitions. [2024-11-12 05:48:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 05:48:08,672 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-12 05:48:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:08,673 INFO L225 Difference]: With dead ends: 297 [2024-11-12 05:48:08,674 INFO L226 Difference]: Without dead ends: 197 [2024-11-12 05:48:08,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:48:08,676 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 95 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:08,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 549 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 05:48:08,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-12 05:48:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 98. [2024-11-12 05:48:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:48:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2024-11-12 05:48:08,694 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 109 [2024-11-12 05:48:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:08,695 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2024-11-12 05:48:08,695 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2024-11-12 05:48:08,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 05:48:08,697 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:08,697 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:08,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 05:48:08,697 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:08,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1657642860, now seen corresponding path program 1 times [2024-11-12 05:48:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:08,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895429943] [2024-11-12 05:48:08,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:08,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:09,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:48:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:09,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:48:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:48:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:48:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:09,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:48:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:09,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:48:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:48:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:48:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:48:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:48:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:48:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:48:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:10,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:48:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:48:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:10,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:48:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:48:10,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:10,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895429943] [2024-11-12 05:48:10,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895429943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:48:10,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:48:10,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 05:48:10,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220964864] [2024-11-12 05:48:10,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:48:10,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:48:10,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:10,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:48:10,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:48:10,017 INFO L87 Difference]: Start difference. First operand 98 states and 144 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:10,845 INFO L93 Difference]: Finished difference Result 236 states and 345 transitions. [2024-11-12 05:48:10,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 05:48:10,846 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-12 05:48:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:10,847 INFO L225 Difference]: With dead ends: 236 [2024-11-12 05:48:10,847 INFO L226 Difference]: Without dead ends: 141 [2024-11-12 05:48:10,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:48:10,849 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 137 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:10,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 435 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 05:48:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-12 05:48:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 74. [2024-11-12 05:48:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:48:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2024-11-12 05:48:10,858 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 109 [2024-11-12 05:48:10,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:10,858 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2024-11-12 05:48:10,859 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-11-12 05:48:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 05:48:10,860 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:10,860 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:10,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 05:48:10,861 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:10,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:10,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1272360715, now seen corresponding path program 1 times [2024-11-12 05:48:10,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:10,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012093305] [2024-11-12 05:48:10,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:10,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:48:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:48:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:48:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:48:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:48:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:48:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:48:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:48:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:48:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:48:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:48:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:48:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:48:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:48:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:48:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 05:48:11,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:11,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012093305] [2024-11-12 05:48:11,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012093305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:48:11,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210094829] [2024-11-12 05:48:11,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:11,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:48:11,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:48:11,064 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:48:11,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:48:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:11,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 05:48:11,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:48:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-12 05:48:11,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:48:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 05:48:11,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210094829] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:48:11,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:48:11,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-12 05:48:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789953265] [2024-11-12 05:48:11,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:48:11,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 05:48:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 05:48:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:48:11,640 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-12 05:48:11,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:11,820 INFO L93 Difference]: Finished difference Result 155 states and 217 transitions. [2024-11-12 05:48:11,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 05:48:11,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 111 [2024-11-12 05:48:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:11,823 INFO L225 Difference]: With dead ends: 155 [2024-11-12 05:48:11,823 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 05:48:11,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-12 05:48:11,824 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 217 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:11,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 174 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:48:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 05:48:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-12 05:48:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 63 states have internal predecessors, (81), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:48:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2024-11-12 05:48:11,834 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 111 [2024-11-12 05:48:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:11,835 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2024-11-12 05:48:11,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 11 states have internal predecessors, (78), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-12 05:48:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2024-11-12 05:48:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 05:48:11,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:11,839 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:11,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 05:48:12,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:48:12,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:12,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash -721783991, now seen corresponding path program 1 times [2024-11-12 05:48:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:12,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114762951] [2024-11-12 05:48:12,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:48:12,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151768135] [2024-11-12 05:48:12,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:12,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:48:12,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:48:12,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:48:12,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 05:48:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:12,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 05:48:12,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:48:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-12 05:48:12,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:48:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 05:48:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:12,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114762951] [2024-11-12 05:48:12,937 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 05:48:12,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151768135] [2024-11-12 05:48:12,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151768135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:48:12,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 05:48:12,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-12 05:48:12,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082303434] [2024-11-12 05:48:12,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 05:48:12,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 05:48:12,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:12,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 05:48:12,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-12 05:48:12,940 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-12 05:48:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:13,666 INFO L93 Difference]: Finished difference Result 255 states and 334 transitions. [2024-11-12 05:48:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 05:48:13,666 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 111 [2024-11-12 05:48:13,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:13,667 INFO L225 Difference]: With dead ends: 255 [2024-11-12 05:48:13,668 INFO L226 Difference]: Without dead ends: 176 [2024-11-12 05:48:13,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-12 05:48:13,671 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 202 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:13,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 728 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 05:48:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-12 05:48:13,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 121. [2024-11-12 05:48:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:48:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2024-11-12 05:48:13,684 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 111 [2024-11-12 05:48:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:13,685 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2024-11-12 05:48:13,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-12 05:48:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2024-11-12 05:48:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 05:48:13,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:13,687 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:13,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 05:48:13,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-12 05:48:13,888 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:13,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:13,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1152762016, now seen corresponding path program 1 times [2024-11-12 05:48:13,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:13,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316502307] [2024-11-12 05:48:13,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:13,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:48:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:48:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:48:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:48:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:48:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:48:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:48:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:48:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:48:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:48:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:48:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:48:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:48:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:48:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:48:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:48:13,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:13,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316502307] [2024-11-12 05:48:13,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316502307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:48:13,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:48:13,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:48:13,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564631233] [2024-11-12 05:48:13,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:48:13,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:48:13,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:13,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:48:13,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:48:13,977 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:14,048 INFO L93 Difference]: Finished difference Result 291 states and 388 transitions. [2024-11-12 05:48:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:48:14,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-12 05:48:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:14,051 INFO L225 Difference]: With dead ends: 291 [2024-11-12 05:48:14,051 INFO L226 Difference]: Without dead ends: 173 [2024-11-12 05:48:14,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:48:14,053 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 83 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:14,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 194 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:48:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-12 05:48:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 121. [2024-11-12 05:48:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.306930693069307) internal successors, (132), 101 states have internal predecessors, (132), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:48:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2024-11-12 05:48:14,068 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 111 [2024-11-12 05:48:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:14,068 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2024-11-12 05:48:14,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2024-11-12 05:48:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 05:48:14,070 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:14,070 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:14,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 05:48:14,071 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:14,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash -850996736, now seen corresponding path program 1 times [2024-11-12 05:48:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:14,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324790074] [2024-11-12 05:48:14,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:48:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:48:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:48:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:48:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:48:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:48:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:48:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:48:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:48:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:48:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:48:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:48:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:48:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:48:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:48:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:48:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:14,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324790074] [2024-11-12 05:48:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324790074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:48:14,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:48:14,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 05:48:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042684427] [2024-11-12 05:48:14,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:48:14,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:48:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:48:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:48:14,759 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:15,517 INFO L93 Difference]: Finished difference Result 484 states and 636 transitions. [2024-11-12 05:48:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 05:48:15,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-12 05:48:15,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:15,521 INFO L225 Difference]: With dead ends: 484 [2024-11-12 05:48:15,522 INFO L226 Difference]: Without dead ends: 366 [2024-11-12 05:48:15,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:48:15,523 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 187 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:15,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 617 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 05:48:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-12 05:48:15,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2024-11-12 05:48:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 206 states have (on average 1.3203883495145632) internal successors, (272), 207 states have internal predecessors, (272), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 05:48:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 324 transitions. [2024-11-12 05:48:15,544 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 324 transitions. Word has length 111 [2024-11-12 05:48:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:15,545 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 324 transitions. [2024-11-12 05:48:15,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 324 transitions. [2024-11-12 05:48:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-12 05:48:15,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:15,546 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:15,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 05:48:15,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:15,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:15,547 INFO L85 PathProgramCache]: Analyzing trace with hash -428294910, now seen corresponding path program 1 times [2024-11-12 05:48:15,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:15,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507869356] [2024-11-12 05:48:15,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:15,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:48:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:48:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:48:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:48:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:48:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:48:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:48:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:48:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:48:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:48:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:48:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:48:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:48:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:48:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:48:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:48:15,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:15,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507869356] [2024-11-12 05:48:15,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507869356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:48:15,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:48:15,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 05:48:15,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940706267] [2024-11-12 05:48:15,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:48:15,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:48:15,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:15,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:48:15,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:48:15,885 INFO L87 Difference]: Start difference. First operand 241 states and 324 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:16,350 INFO L93 Difference]: Finished difference Result 703 states and 924 transitions. [2024-11-12 05:48:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 05:48:16,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-12 05:48:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:16,355 INFO L225 Difference]: With dead ends: 703 [2024-11-12 05:48:16,355 INFO L226 Difference]: Without dead ends: 465 [2024-11-12 05:48:16,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:48:16,356 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 142 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:16,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 424 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 05:48:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-12 05:48:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 248. [2024-11-12 05:48:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.323943661971831) internal successors, (282), 214 states have internal predecessors, (282), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 05:48:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 334 transitions. [2024-11-12 05:48:16,388 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 334 transitions. Word has length 111 [2024-11-12 05:48:16,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:16,388 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 334 transitions. [2024-11-12 05:48:16,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 334 transitions. [2024-11-12 05:48:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 05:48:16,390 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:16,390 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:16,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 05:48:16,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:16,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash -897246384, now seen corresponding path program 1 times [2024-11-12 05:48:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:16,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327985981] [2024-11-12 05:48:16,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:16,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:48:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:48:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:48:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:48:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:48:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:48:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:48:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:48:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:48:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:48:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:48:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:48:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:48:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:48:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:48:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:17,970 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:48:17,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:17,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327985981] [2024-11-12 05:48:17,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327985981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:48:17,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:48:17,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 05:48:17,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900581564] [2024-11-12 05:48:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:48:17,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 05:48:17,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:17,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 05:48:17,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 05:48:17,973 INFO L87 Difference]: Start difference. First operand 248 states and 334 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:19,528 INFO L93 Difference]: Finished difference Result 695 states and 922 transitions. [2024-11-12 05:48:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 05:48:19,529 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-12 05:48:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:19,546 INFO L225 Difference]: With dead ends: 695 [2024-11-12 05:48:19,546 INFO L226 Difference]: Without dead ends: 450 [2024-11-12 05:48:19,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2024-11-12 05:48:19,548 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 304 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:19,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 727 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 05:48:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-12 05:48:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 304. [2024-11-12 05:48:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 269 states have (on average 1.3234200743494424) internal successors, (356), 270 states have internal predecessors, (356), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 05:48:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 408 transitions. [2024-11-12 05:48:19,577 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 408 transitions. Word has length 112 [2024-11-12 05:48:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:19,578 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 408 transitions. [2024-11-12 05:48:19,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 408 transitions. [2024-11-12 05:48:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 05:48:19,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:19,580 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:19,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 05:48:19,580 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:19,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash -595481104, now seen corresponding path program 1 times [2024-11-12 05:48:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087669654] [2024-11-12 05:48:19,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:48:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:48:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:48:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:48:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:48:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:48:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:48:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:48:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:48:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:48:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:48:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:48:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:48:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:48:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:48:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:48:20,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:20,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087669654] [2024-11-12 05:48:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087669654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:48:20,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:48:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 05:48:20,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416370461] [2024-11-12 05:48:20,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:48:20,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 05:48:20,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:20,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 05:48:20,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 05:48:20,264 INFO L87 Difference]: Start difference. First operand 304 states and 408 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:20,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:20,867 INFO L93 Difference]: Finished difference Result 785 states and 1023 transitions. [2024-11-12 05:48:20,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 05:48:20,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-12 05:48:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:20,873 INFO L225 Difference]: With dead ends: 785 [2024-11-12 05:48:20,873 INFO L226 Difference]: Without dead ends: 484 [2024-11-12 05:48:20,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-12 05:48:20,875 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 208 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:20,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 771 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 05:48:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-12 05:48:20,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 310. [2024-11-12 05:48:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 275 states have (on average 1.3163636363636364) internal successors, (362), 276 states have internal predecessors, (362), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 05:48:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 414 transitions. [2024-11-12 05:48:20,904 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 414 transitions. Word has length 112 [2024-11-12 05:48:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:20,904 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 414 transitions. [2024-11-12 05:48:20,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 414 transitions. [2024-11-12 05:48:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 05:48:20,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:20,906 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:20,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 05:48:20,906 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:20,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:20,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1070897991, now seen corresponding path program 1 times [2024-11-12 05:48:20,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:20,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195125210] [2024-11-12 05:48:20,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:20,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:48:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:48:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:48:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:48:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:48:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:48:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:48:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:48:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:48:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:48:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:48:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:48:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:48:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:48:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:48:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:48:21,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:21,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195125210] [2024-11-12 05:48:21,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195125210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:48:21,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:48:21,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 05:48:21,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427053894] [2024-11-12 05:48:21,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:48:21,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:48:21,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:21,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:48:21,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:48:21,188 INFO L87 Difference]: Start difference. First operand 310 states and 414 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:21,527 INFO L93 Difference]: Finished difference Result 769 states and 1007 transitions. [2024-11-12 05:48:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 05:48:21,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-12 05:48:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:21,530 INFO L225 Difference]: With dead ends: 769 [2024-11-12 05:48:21,530 INFO L226 Difference]: Without dead ends: 462 [2024-11-12 05:48:21,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:48:21,532 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 78 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:21,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 583 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:48:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-12 05:48:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 322. [2024-11-12 05:48:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 287 states have (on average 1.3170731707317074) internal successors, (378), 288 states have internal predecessors, (378), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 05:48:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 430 transitions. [2024-11-12 05:48:21,573 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 430 transitions. Word has length 112 [2024-11-12 05:48:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:21,573 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 430 transitions. [2024-11-12 05:48:21,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 430 transitions. [2024-11-12 05:48:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 05:48:21,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:21,575 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:21,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 05:48:21,575 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:21,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:21,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2044800520, now seen corresponding path program 1 times [2024-11-12 05:48:21,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:21,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517619938] [2024-11-12 05:48:21,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:48:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:48:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:48:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:48:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:48:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:48:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:48:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:48:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:48:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:48:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:48:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 05:48:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:48:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:48:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:48:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:48:21,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:48:21,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517619938] [2024-11-12 05:48:21,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517619938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:48:21,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:48:21,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:48:21,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487810517] [2024-11-12 05:48:21,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:48:21,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:48:21,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:48:21,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:48:21,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:48:21,655 INFO L87 Difference]: Start difference. First operand 322 states and 430 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:21,745 INFO L93 Difference]: Finished difference Result 725 states and 970 transitions. [2024-11-12 05:48:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:48:21,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-12 05:48:21,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:21,748 INFO L225 Difference]: With dead ends: 725 [2024-11-12 05:48:21,748 INFO L226 Difference]: Without dead ends: 406 [2024-11-12 05:48:21,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:48:21,751 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 28 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:21,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 170 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:48:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-12 05:48:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 328. [2024-11-12 05:48:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 293 states have (on average 1.3139931740614335) internal successors, (385), 294 states have internal predecessors, (385), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 05:48:21,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 437 transitions. [2024-11-12 05:48:21,774 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 437 transitions. Word has length 112 [2024-11-12 05:48:21,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:21,775 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 437 transitions. [2024-11-12 05:48:21,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 05:48:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 437 transitions. [2024-11-12 05:48:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-12 05:48:21,776 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:21,776 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:21,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 05:48:21,777 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:21,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:21,777 INFO L85 PathProgramCache]: Analyzing trace with hash 338108489, now seen corresponding path program 1 times [2024-11-12 05:48:21,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:48:21,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005889113] [2024-11-12 05:48:21,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:21,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:48:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:48:21,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339698574] [2024-11-12 05:48:21,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:21,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:48:21,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:48:21,834 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:48:21,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 05:48:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:48:22,358 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:48:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:48:22,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:48:22,473 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:48:22,474 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:48:22,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 05:48:22,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:48:22,680 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:22,781 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:48:22,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:48:22 BoogieIcfgContainer [2024-11-12 05:48:22,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:48:22,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:48:22,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:48:22,785 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:48:22,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:47:55" (3/4) ... [2024-11-12 05:48:22,788 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:48:22,789 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:48:22,790 INFO L158 Benchmark]: Toolchain (without parser) took 28728.22ms. Allocated memory was 151.0MB in the beginning and 270.5MB in the end (delta: 119.5MB). Free memory was 120.0MB in the beginning and 122.5MB in the end (delta: -2.4MB). Peak memory consumption was 119.9MB. Max. memory is 16.1GB. [2024-11-12 05:48:22,790 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:48:22,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.85ms. Allocated memory is still 151.0MB. Free memory was 120.0MB in the beginning and 104.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:48:22,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.59ms. Allocated memory is still 151.0MB. Free memory was 104.5MB in the beginning and 101.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:48:22,791 INFO L158 Benchmark]: Boogie Preprocessor took 60.72ms. Allocated memory is still 151.0MB. Free memory was 101.9MB in the beginning and 98.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:48:22,792 INFO L158 Benchmark]: RCFGBuilder took 624.90ms. Allocated memory is still 151.0MB. Free memory was 98.2MB in the beginning and 76.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 05:48:22,792 INFO L158 Benchmark]: TraceAbstraction took 27581.89ms. Allocated memory was 151.0MB in the beginning and 270.5MB in the end (delta: 119.5MB). Free memory was 75.7MB in the beginning and 123.5MB in the end (delta: -47.8MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2024-11-12 05:48:22,792 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 270.5MB. Free memory was 123.5MB in the beginning and 122.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:48:22,796 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.18ms. Allocated memory is still 151.0MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.85ms. Allocated memory is still 151.0MB. Free memory was 120.0MB in the beginning and 104.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.59ms. Allocated memory is still 151.0MB. Free memory was 104.5MB in the beginning and 101.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.72ms. Allocated memory is still 151.0MB. Free memory was 101.9MB in the beginning and 98.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 624.90ms. Allocated memory is still 151.0MB. Free memory was 98.2MB in the beginning and 76.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 27581.89ms. Allocated memory was 151.0MB in the beginning and 270.5MB in the end (delta: 119.5MB). Free memory was 75.7MB in the beginning and 123.5MB in the end (delta: -47.8MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 270.5MB. Free memory was 123.5MB in the beginning and 122.5MB 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 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] isInitial = 1 [L124] FCALL initially() [L125] int k_loop; [L126] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] COND TRUE k_loop < 1 [L127] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L128] RET updateVariables() [L129] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=1, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=1, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L129] RET step() [L130] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=1, var_1_11=1, var_1_12=12, var_1_13=12, var_1_15=0, var_1_16=1, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=3, var_1_6=12, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.4s, OverallIterations: 16, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2249 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2243 mSDsluCounter, 6419 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4706 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4445 IncrementalHoareTripleChecker+Invalid, 4514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 1713 mSDtfsCounter, 4445 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1034 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=15, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 1280 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 2101 NumberOfCodeBlocks, 2101 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1970 ConstructedInterpolants, 0 QuantifiedInterpolants, 8342 SizeOfPredicates, 9 NumberOfNonLiveVariables, 552 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 7374/7560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:48:22,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:48:24,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:48:25,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:48:25,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:48:25,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:48:25,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:48:25,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:48:25,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:48:25,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:48:25,110 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:48:25,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:48:25,112 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:48:25,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:48:25,113 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:48:25,113 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:48:25,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:48:25,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:48:25,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:48:25,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:48:25,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:48:25,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:48:25,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:48:25,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:48:25,119 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:48:25,120 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:48:25,120 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:48:25,120 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:48:25,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:48:25,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:48:25,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:48:25,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:48:25,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:48:25,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:48:25,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:48:25,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:48:25,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:48:25,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:48:25,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:48:25,124 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:48:25,125 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:48:25,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:48:25,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:48:25,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:48:25,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:48:25,126 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d [2024-11-12 05:48:25,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:48:25,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:48:25,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:48:25,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:48:25,490 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:48:25,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-12 05:48:27,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:48:27,248 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:48:27,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-12 05:48:27,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ae79cc5/9168ec9f456948de877d78c9c899fb59/FLAG7d30cfb76 [2024-11-12 05:48:27,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ae79cc5/9168ec9f456948de877d78c9c899fb59 [2024-11-12 05:48:27,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:48:27,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:48:27,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:48:27,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:48:27,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:48:27,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0aca2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27, skipping insertion in model container [2024-11-12 05:48:27,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:48:27,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-11-12 05:48:27,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:48:27,599 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:48:27,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-11-12 05:48:27,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:48:27,655 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:48:27,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27 WrapperNode [2024-11-12 05:48:27,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:48:27,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:48:27,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:48:27,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:48:27,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,716 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-12 05:48:27,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:48:27,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:48:27,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:48:27,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:48:27,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,770 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:48:27,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,787 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:48:27,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:48:27,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:48:27,801 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:48:27,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (1/1) ... [2024-11-12 05:48:27,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:48:27,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:48:27,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:48:27,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:48:27,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:48:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:48:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:48:27,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:48:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:48:27,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:48:27,965 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:48:27,968 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:48:28,411 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-12 05:48:28,411 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:48:28,426 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:48:28,426 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:48:28,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:48:28 BoogieIcfgContainer [2024-11-12 05:48:28,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:48:28,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:48:28,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:48:28,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:48:28,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:48:27" (1/3) ... [2024-11-12 05:48:28,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a081ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:48:28, skipping insertion in model container [2024-11-12 05:48:28,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:48:27" (2/3) ... [2024-11-12 05:48:28,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a081ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:48:28, skipping insertion in model container [2024-11-12 05:48:28,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:48:28" (3/3) ... [2024-11-12 05:48:28,439 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-12 05:48:28,456 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:48:28,457 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:48:28,549 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:48:28,558 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;@696db141, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:48:28,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:48:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:48:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 05:48:28,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:28,575 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:28,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:28,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:28,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1048997348, now seen corresponding path program 1 times [2024-11-12 05:48:28,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:48:28,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270834527] [2024-11-12 05:48:28,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:28,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:48:28,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:48:28,602 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:48:28,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:48:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:28,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:48:28,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:48:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-12 05:48:28,883 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:48:28,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:48:28,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270834527] [2024-11-12 05:48:28,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270834527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:48:28,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:48:28,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:48:28,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635181899] [2024-11-12 05:48:28,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:48:28,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:48:28,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:48:28,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:48:28,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:48:28,918 INFO L87 Difference]: Start difference. First operand has 56 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:48:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:48:28,946 INFO L93 Difference]: Finished difference Result 109 states and 178 transitions. [2024-11-12 05:48:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:48:28,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2024-11-12 05:48:28,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:48:28,958 INFO L225 Difference]: With dead ends: 109 [2024-11-12 05:48:28,958 INFO L226 Difference]: Without dead ends: 52 [2024-11-12 05:48:28,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:48:28,967 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:48:28,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:48:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-12 05:48:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-12 05:48:29,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:48:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-11-12 05:48:29,014 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 100 [2024-11-12 05:48:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:48:29,016 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-11-12 05:48:29,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:48:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-11-12 05:48:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 05:48:29,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:48:29,022 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:48:29,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 05:48:29,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:48:29,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:48:29,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:48:29,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1296811503, now seen corresponding path program 1 times [2024-11-12 05:48:29,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:48:29,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025775998] [2024-11-12 05:48:29,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:48:29,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:48:29,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:48:29,232 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:48:29,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:48:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:48:29,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 05:48:29,505 INFO L279 TraceCheckSpWp]: Computing forward predicates...