./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.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 3ee40dd4c738937df3cfe28722079ab6375e7aef2ee40a12cb1af18759ea102b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:00:37,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:00:37,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:00:37,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:00:37,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:00:37,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:00:37,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:00:37,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:00:37,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:00:37,881 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:00:37,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:00:37,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:00:37,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:00:37,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:00:37,886 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:00:37,887 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:00:37,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:00:37,887 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:00:37,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:00:37,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:00:37,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:00:37,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:00:37,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:00:37,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:00:37,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:00:37,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:00:37,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:00:37,889 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:00:37,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:00:37,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:00:37,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:00:37,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:00:37,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:00:37,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:00:37,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:00:37,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:00:37,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:00:37,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:00:37,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:00:37,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:00:37,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:00:37,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:00:37,891 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 -> 3ee40dd4c738937df3cfe28722079ab6375e7aef2ee40a12cb1af18759ea102b [2024-10-13 02:00:38,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:00:38,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:00:38,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:00:38,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:00:38,141 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:00:38,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-10-13 02:00:39,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:00:39,615 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:00:39,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-10-13 02:00:39,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8239fa9e8/9af930e4f7984d60a8b9d5e2925189b8/FLAGc6d72a8a7 [2024-10-13 02:00:39,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8239fa9e8/9af930e4f7984d60a8b9d5e2925189b8 [2024-10-13 02:00:39,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:00:39,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:00:39,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:00:39,650 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:00:39,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:00:39,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:00:39" (1/1) ... [2024-10-13 02:00:39,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b4a7144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:39, skipping insertion in model container [2024-10-13 02:00:39,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:00:39" (1/1) ... [2024-10-13 02:00:39,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:00:39,859 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i[919,932] [2024-10-13 02:00:39,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:00:39,949 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:00:39,960 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i[919,932] [2024-10-13 02:00:39,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:00:40,059 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:00:40,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40 WrapperNode [2024-10-13 02:00:40,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:00:40,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:00:40,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:00:40,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:00:40,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,124 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 214 [2024-10-13 02:00:40,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:00:40,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:00:40,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:00:40,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:00:40,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,165 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:00:40,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:00:40,196 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:00:40,196 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:00:40,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:00:40,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (1/1) ... [2024-10-13 02:00:40,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:00:40,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:00:40,226 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-10-13 02:00:40,229 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-10-13 02:00:40,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:00:40,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:00:40,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:00:40,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:00:40,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:00:40,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:00:40,353 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:00:40,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:00:40,762 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 02:00:40,763 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:00:40,808 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:00:40,808 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:00:40,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:00:40 BoogieIcfgContainer [2024-10-13 02:00:40,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:00:40,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:00:40,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:00:40,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:00:40,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:00:39" (1/3) ... [2024-10-13 02:00:40,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e0da16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:00:40, skipping insertion in model container [2024-10-13 02:00:40,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:00:40" (2/3) ... [2024-10-13 02:00:40,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e0da16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:00:40, skipping insertion in model container [2024-10-13 02:00:40,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:00:40" (3/3) ... [2024-10-13 02:00:40,817 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-59.i [2024-10-13 02:00:40,832 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:00:40,832 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:00:40,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:00:40,905 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;@7670e1e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:00:40,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:00:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 56 states have internal predecessors, (86), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 02:00:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 02:00:40,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:00:40,926 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:00:40,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:00:40,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:00:40,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1895209208, now seen corresponding path program 1 times [2024-10-13 02:00:40,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:00:40,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865142752] [2024-10-13 02:00:40,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:00:40,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:00:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:00:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:00:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:00:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:00:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:00:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:00:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:00:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:00:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:00:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:00:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:00:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:00:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:00:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:00:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:00:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:00:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:00:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:00:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:00:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:00:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:00:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:00:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:00:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:00:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:00:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:00:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:00:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 02:00:41,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:00:41,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865142752] [2024-10-13 02:00:41,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865142752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:00:41,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:00:41,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:00:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708449287] [2024-10-13 02:00:41,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:00:41,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:00:41,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:00:41,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:00:41,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:00:41,380 INFO L87 Difference]: Start difference. First operand has 85 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 56 states have internal predecessors, (86), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 02:00:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:00:41,423 INFO L93 Difference]: Finished difference Result 167 states and 305 transitions. [2024-10-13 02:00:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:00:41,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 170 [2024-10-13 02:00:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:00:41,436 INFO L225 Difference]: With dead ends: 167 [2024-10-13 02:00:41,436 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 02:00:41,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:00:41,442 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:00:41,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:00:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 02:00:41,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 02:00:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.462962962962963) internal successors, (79), 54 states have internal predecessors, (79), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 02:00:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 133 transitions. [2024-10-13 02:00:41,506 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 133 transitions. Word has length 170 [2024-10-13 02:00:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:00:41,506 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 133 transitions. [2024-10-13 02:00:41,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-13 02:00:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 133 transitions. [2024-10-13 02:00:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 02:00:41,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:00:41,510 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:00:41,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:00:41,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:00:41,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:00:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1418918254, now seen corresponding path program 1 times [2024-10-13 02:00:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:00:41,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884744456] [2024-10-13 02:00:41,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:00:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:00:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:00:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:00:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:00:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:00:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:00:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:00:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:00:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:00:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:41,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:00:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:00:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:00:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:00:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:00:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:00:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:00:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:00:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:00:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:00:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:00:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:00:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:00:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:00:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:00:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:00:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:00:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:00:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:00:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 02:00:42,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:00:42,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884744456] [2024-10-13 02:00:42,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884744456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:00:42,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:00:42,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:00:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68979031] [2024-10-13 02:00:42,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:00:42,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:00:42,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:00:42,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:00:42,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:00:42,118 INFO L87 Difference]: Start difference. First operand 83 states and 133 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 02:00:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:00:42,318 INFO L93 Difference]: Finished difference Result 248 states and 398 transitions. [2024-10-13 02:00:42,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:00:42,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2024-10-13 02:00:42,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:00:42,323 INFO L225 Difference]: With dead ends: 248 [2024-10-13 02:00:42,323 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 02:00:42,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:00:42,326 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 85 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:00:42,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 384 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:00:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 02:00:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 130. [2024-10-13 02:00:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 02:00:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 206 transitions. [2024-10-13 02:00:42,363 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 206 transitions. Word has length 170 [2024-10-13 02:00:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:00:42,363 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 206 transitions. [2024-10-13 02:00:42,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 02:00:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 206 transitions. [2024-10-13 02:00:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 02:00:42,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:00:42,366 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:00:42,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:00:42,367 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:00:42,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:00:42,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1948396473, now seen corresponding path program 1 times [2024-10-13 02:00:42,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:00:42,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503228612] [2024-10-13 02:00:42,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:00:42,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:00:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:00:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:00:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:00:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:00:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:00:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:00:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:00:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:00:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:00:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:00:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:00:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:00:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:00:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:00:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:00:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:00:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:00:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:00:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:00:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:00:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:00:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:00:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:00:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:00:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:00:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:00:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:00:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 02:00:42,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:00:42,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503228612] [2024-10-13 02:00:42,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503228612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:00:42,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:00:42,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:00:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837044618] [2024-10-13 02:00:42,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:00:42,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:00:42,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:00:42,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:00:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:00:42,883 INFO L87 Difference]: Start difference. First operand 130 states and 206 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 02:00:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:00:43,313 INFO L93 Difference]: Finished difference Result 292 states and 466 transitions. [2024-10-13 02:00:43,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:00:43,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-13 02:00:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:00:43,316 INFO L225 Difference]: With dead ends: 292 [2024-10-13 02:00:43,319 INFO L226 Difference]: Without dead ends: 210 [2024-10-13 02:00:43,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:00:43,321 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 265 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:00:43,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 217 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:00:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-13 02:00:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 145. [2024-10-13 02:00:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 88 states have internal predecessors, (124), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 02:00:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 232 transitions. [2024-10-13 02:00:43,363 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 232 transitions. Word has length 171 [2024-10-13 02:00:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:00:43,364 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 232 transitions. [2024-10-13 02:00:43,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 02:00:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 232 transitions. [2024-10-13 02:00:43,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 02:00:43,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:00:43,369 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:00:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:00:43,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:00:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:00:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1891138171, now seen corresponding path program 1 times [2024-10-13 02:00:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:00:43,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272871383] [2024-10-13 02:00:43,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:00:43,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:00:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:00:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:00:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:00:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:00:43,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:00:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:00:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:00:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:00:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:00:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:00:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:00:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:00:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:00:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:00:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:00:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:00:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:00:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:00:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:00:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:00:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:00:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:00:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:00:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:00:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:00:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:00:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:00:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-13 02:00:43,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:00:43,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272871383] [2024-10-13 02:00:43,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272871383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:00:43,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:00:43,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:00:43,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932446950] [2024-10-13 02:00:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:00:43,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:00:43,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:00:43,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:00:43,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:00:43,730 INFO L87 Difference]: Start difference. First operand 145 states and 232 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 02:00:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:00:43,877 INFO L93 Difference]: Finished difference Result 378 states and 612 transitions. [2024-10-13 02:00:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:00:43,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-13 02:00:43,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:00:43,880 INFO L225 Difference]: With dead ends: 378 [2024-10-13 02:00:43,880 INFO L226 Difference]: Without dead ends: 281 [2024-10-13 02:00:43,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:00:43,884 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 131 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:00:43,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 415 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:00:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-13 02:00:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 240. [2024-10-13 02:00:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 155 states have (on average 1.4387096774193548) internal successors, (223), 155 states have internal predecessors, (223), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-13 02:00:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 385 transitions. [2024-10-13 02:00:43,929 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 385 transitions. Word has length 171 [2024-10-13 02:00:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:00:43,930 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 385 transitions. [2024-10-13 02:00:43,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-13 02:00:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 385 transitions. [2024-10-13 02:00:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 02:00:43,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:00:43,932 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:00:43,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:00:43,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:00:43,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:00:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash 711858297, now seen corresponding path program 1 times [2024-10-13 02:00:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:00:43,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013294521] [2024-10-13 02:00:43,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:00:43,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:00:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:00:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:00:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:00:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:00:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:00:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:00:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:00:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:00:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:00:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:00:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:00:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:00:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:00:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:00:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:00:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:00:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 02:00:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:00:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 02:00:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 02:00:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 02:00:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 02:00:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 02:00:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 02:00:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 02:00:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 02:00:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 02:00:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 6 proven. 72 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 02:00:44,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:00:44,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013294521] [2024-10-13 02:00:44,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013294521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:00:44,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573343946] [2024-10-13 02:00:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:00:44,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:00:44,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:00:44,401 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-10-13 02:00:44,421 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-10-13 02:00:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:44,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 02:00:44,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:00:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 819 proven. 105 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 02:00:45,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:00:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-10-13 02:00:46,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573343946] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:00:46,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:00:46,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 24 [2024-10-13 02:00:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747782683] [2024-10-13 02:00:46,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:00:46,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 02:00:46,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:00:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 02:00:46,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2024-10-13 02:00:46,404 INFO L87 Difference]: Start difference. First operand 240 states and 385 transitions. Second operand has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 24 states have internal predecessors, (116), 8 states have call successors, (81), 4 states have call predecessors, (81), 8 states have return successors, (81), 8 states have call predecessors, (81), 8 states have call successors, (81) [2024-10-13 02:00:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:00:50,565 INFO L93 Difference]: Finished difference Result 1024 states and 1572 transitions. [2024-10-13 02:00:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-10-13 02:00:50,566 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 24 states have internal predecessors, (116), 8 states have call successors, (81), 4 states have call predecessors, (81), 8 states have return successors, (81), 8 states have call predecessors, (81), 8 states have call successors, (81) Word has length 172 [2024-10-13 02:00:50,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:00:50,570 INFO L225 Difference]: With dead ends: 1024 [2024-10-13 02:00:50,571 INFO L226 Difference]: Without dead ends: 832 [2024-10-13 02:00:50,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3852 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1892, Invalid=9238, Unknown=0, NotChecked=0, Total=11130 [2024-10-13 02:00:50,575 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1287 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:00:50,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 1761 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 02:00:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-13 02:00:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 381. [2024-10-13 02:00:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 259 states have (on average 1.3243243243243243) internal successors, (343), 261 states have internal predecessors, (343), 105 states have call successors, (105), 16 states have call predecessors, (105), 16 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-13 02:00:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 553 transitions. [2024-10-13 02:00:50,654 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 553 transitions. Word has length 172 [2024-10-13 02:00:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:00:50,655 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 553 transitions. [2024-10-13 02:00:50,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.833333333333333) internal successors, (116), 24 states have internal predecessors, (116), 8 states have call successors, (81), 4 states have call predecessors, (81), 8 states have return successors, (81), 8 states have call predecessors, (81), 8 states have call successors, (81) [2024-10-13 02:00:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 553 transitions. [2024-10-13 02:00:50,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 02:00:50,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:00:50,657 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:00:50,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 02:00:50,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:00:50,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:00:50,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:00:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash 750693170, now seen corresponding path program 1 times [2024-10-13 02:00:50,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:00:50,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533068179] [2024-10-13 02:00:50,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:00:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:00:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:00:50,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123275295] [2024-10-13 02:00:50,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:00:50,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:00:50,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:00:50,989 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-10-13 02:00:50,990 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-10-13 02:00:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:00:51,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-13 02:00:51,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:00:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 338 proven. 300 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-10-13 02:00:52,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:01:05,632 WARN L286 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 02:01:19,161 WARN L286 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 02:01:39,205 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 02:01:48,364 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 02:01:52,376 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse4 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse3 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (forall ((v_z_10 Int)) (or (< v_z_10 .cse3) (< v_z_10 .cse1) (< .cse4 v_z_10) (not (= (mod (* v_z_10 .cse2) 4294967296) v_z_10)))) (or (not (= .cse5 .cse0)) (< .cse6 .cse0)) (or (< .cse4 .cse5) (< .cse5 .cse3) (< .cse6 .cse5)))))) is different from false [2024-10-13 02:01:58,721 WARN L286 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 02:02:13,584 WARN L286 SmtUtils]: Spent 11.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)