./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_3_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/combinations/gcd_4+newton_3_1.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 ad6236f3b1535aee53ef497474ba76faac9143455d497d8d917066c0b5859668 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 03:41:07,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 03:41:07,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 03:41:07,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 03:41:07,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 03:41:07,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 03:41:07,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 03:41:07,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 03:41:07,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 03:41:07,432 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 03:41:07,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 03:41:07,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 03:41:07,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 03:41:07,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 03:41:07,433 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 03:41:07,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 03:41:07,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 03:41:07,434 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 03:41:07,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 03:41:07,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 03:41:07,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 03:41:07,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 03:41:07,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 03:41:07,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 03:41:07,442 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 03:41:07,442 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 03:41:07,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 03:41:07,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 03:41:07,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 03:41:07,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 03:41:07,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 03:41:07,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 03:41:07,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 03:41:07,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 03:41:07,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 03:41:07,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 03:41:07,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 03:41:07,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 03:41:07,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 03:41:07,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 03:41:07,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 03:41:07,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 03:41:07,445 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 -> ad6236f3b1535aee53ef497474ba76faac9143455d497d8d917066c0b5859668 [2024-11-22 03:41:07,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 03:41:07,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 03:41:07,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 03:41:07,700 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 03:41:07,700 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 03:41:07,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_1.i [2024-11-22 03:41:08,868 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 03:41:09,046 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 03:41:09,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i [2024-11-22 03:41:09,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47ed9c148/3b751a382b4c4aef9f3b643445252c7d/FLAG2458b19e0 [2024-11-22 03:41:09,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47ed9c148/3b751a382b4c4aef9f3b643445252c7d [2024-11-22 03:41:09,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 03:41:09,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 03:41:09,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 03:41:09,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 03:41:09,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 03:41:09,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a1cf58c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09, skipping insertion in model container [2024-11-22 03:41:09,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 03:41:09,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[1224,1237] [2024-11-22 03:41:09,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[2848,2861] [2024-11-22 03:41:09,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 03:41:09,679 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 03:41:09,692 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[1224,1237] [2024-11-22 03:41:09,701 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[2848,2861] [2024-11-22 03:41:09,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 03:41:09,722 INFO L204 MainTranslator]: Completed translation [2024-11-22 03:41:09,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09 WrapperNode [2024-11-22 03:41:09,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 03:41:09,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 03:41:09,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 03:41:09,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 03:41:09,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,738 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,758 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 84 [2024-11-22 03:41:09,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 03:41:09,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 03:41:09,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 03:41:09,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 03:41:09,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,780 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-22 03:41:09,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 03:41:09,796 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 03:41:09,796 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 03:41:09,797 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 03:41:09,797 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (1/1) ... [2024-11-22 03:41:09,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 03:41:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 03:41:09,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 03:41:09,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 03:41:09,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 03:41:09,877 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-22 03:41:09,877 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-22 03:41:09,877 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-22 03:41:09,878 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-22 03:41:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 03:41:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 03:41:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 03:41:09,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 03:41:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 03:41:09,879 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 03:41:09,940 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 03:41:09,943 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 03:41:10,200 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-22 03:41:10,200 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 03:41:10,215 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 03:41:10,216 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 03:41:10,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:41:10 BoogieIcfgContainer [2024-11-22 03:41:10,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 03:41:10,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 03:41:10,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 03:41:10,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 03:41:10,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 03:41:09" (1/3) ... [2024-11-22 03:41:10,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e445f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 03:41:10, skipping insertion in model container [2024-11-22 03:41:10,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:09" (2/3) ... [2024-11-22 03:41:10,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e445f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 03:41:10, skipping insertion in model container [2024-11-22 03:41:10,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:41:10" (3/3) ... [2024-11-22 03:41:10,225 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_1.i [2024-11-22 03:41:10,238 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 03:41:10,238 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 03:41:10,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 03:41:10,298 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;@460cb423, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 03:41:10,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 03:41:10,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 03:41:10,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 03:41:10,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:10,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:10,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:10,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:10,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1780387208, now seen corresponding path program 1 times [2024-11-22 03:41:10,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:41:10,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420227549] [2024-11-22 03:41:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:10,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:41:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:41:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:10,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:41:10,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420227549] [2024-11-22 03:41:10,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420227549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:41:10,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:41:10,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 03:41:10,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121732174] [2024-11-22 03:41:10,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:41:10,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 03:41:10,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:41:10,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 03:41:10,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:10,572 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:10,610 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2024-11-22 03:41:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 03:41:10,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 03:41:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:10,618 INFO L225 Difference]: With dead ends: 90 [2024-11-22 03:41:10,618 INFO L226 Difference]: Without dead ends: 42 [2024-11-22 03:41:10,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:10,623 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:10,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 03:41:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-22 03:41:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-22 03:41:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 03:41:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-22 03:41:10,658 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2024-11-22 03:41:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:10,658 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-22 03:41:10,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:10,659 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-22 03:41:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 03:41:10,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:10,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:10,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 03:41:10,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:10,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:10,661 INFO L85 PathProgramCache]: Analyzing trace with hash 413718792, now seen corresponding path program 1 times [2024-11-22 03:41:10,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:41:10,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333862647] [2024-11-22 03:41:10,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:10,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:41:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:41:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:10,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:41:10,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333862647] [2024-11-22 03:41:10,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333862647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:41:10,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:41:10,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 03:41:10,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672578199] [2024-11-22 03:41:10,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:41:10,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 03:41:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:41:10,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 03:41:10,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:10,764 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:10,780 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-11-22 03:41:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 03:41:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 03:41:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:10,782 INFO L225 Difference]: With dead ends: 55 [2024-11-22 03:41:10,782 INFO L226 Difference]: Without dead ends: 41 [2024-11-22 03:41:10,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:10,783 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:10,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 03:41:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-22 03:41:10,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-22 03:41:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 03:41:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-22 03:41:10,790 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 13 [2024-11-22 03:41:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:10,790 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-22 03:41:10,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-22 03:41:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 03:41:10,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:10,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:10,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 03:41:10,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:10,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1714945339, now seen corresponding path program 1 times [2024-11-22 03:41:10,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:41:10,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575845453] [2024-11-22 03:41:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:10,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:41:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:41:10,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:10,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:41:10,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575845453] [2024-11-22 03:41:10,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575845453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:41:10,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:41:10,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 03:41:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951882820] [2024-11-22 03:41:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:41:10,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 03:41:10,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:41:10,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 03:41:10,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:10,936 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:10,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:10,964 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-11-22 03:41:10,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 03:41:10,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-22 03:41:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:10,967 INFO L225 Difference]: With dead ends: 56 [2024-11-22 03:41:10,968 INFO L226 Difference]: Without dead ends: 43 [2024-11-22 03:41:10,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:10,969 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:10,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 03:41:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-22 03:41:10,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-22 03:41:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 03:41:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-22 03:41:10,976 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 15 [2024-11-22 03:41:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:10,976 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-22 03:41:10,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:10,977 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-22 03:41:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 03:41:10,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:10,977 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:10,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 03:41:10,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:10,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:10,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1030187394, now seen corresponding path program 1 times [2024-11-22 03:41:10,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:41:10,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740765814] [2024-11-22 03:41:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:10,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:41:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:41:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:11,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:41:11,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740765814] [2024-11-22 03:41:11,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740765814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 03:41:11,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812947105] [2024-11-22 03:41:11,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:11,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:11,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 03:41:11,100 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 03:41:11,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 03:41:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:41:11,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 03:41:11,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:11,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 03:41:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:11,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812947105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 03:41:11,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 03:41:11,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-22 03:41:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481145067] [2024-11-22 03:41:11,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 03:41:11,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 03:41:11,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:41:11,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 03:41:11,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-22 03:41:11,284 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:11,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:11,330 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-11-22 03:41:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 03:41:11,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-22 03:41:11,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:11,333 INFO L225 Difference]: With dead ends: 60 [2024-11-22 03:41:11,333 INFO L226 Difference]: Without dead ends: 47 [2024-11-22 03:41:11,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-22 03:41:11,335 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:11,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 03:41:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-22 03:41:11,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-22 03:41:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 03:41:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-22 03:41:11,340 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 17 [2024-11-22 03:41:11,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:11,340 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-22 03:41:11,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:11,341 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-22 03:41:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 03:41:11,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:11,341 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:11,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 03:41:11,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:11,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:11,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash -626272964, now seen corresponding path program 2 times [2024-11-22 03:41:11,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:41:11,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243122687] [2024-11-22 03:41:11,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 03:41:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:41:11,572 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 03:41:11,572 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 03:41:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:11,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:41:11,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243122687] [2024-11-22 03:41:11,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243122687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 03:41:11,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292454455] [2024-11-22 03:41:11,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 03:41:11,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:11,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 03:41:11,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 03:41:11,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 03:41:11,723 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 03:41:11,723 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 03:41:11,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 03:41:11,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:11,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 03:41:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292454455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 03:41:11,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 03:41:11,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-22 03:41:11,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442034904] [2024-11-22 03:41:11,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 03:41:11,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 03:41:11,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:41:11,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 03:41:11,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2024-11-22 03:41:11,891 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:11,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:11,993 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-11-22 03:41:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 03:41:11,994 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 03:41:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:11,996 INFO L225 Difference]: With dead ends: 69 [2024-11-22 03:41:11,997 INFO L226 Difference]: Without dead ends: 54 [2024-11-22 03:41:11,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2024-11-22 03:41:11,998 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:11,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 257 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 03:41:11,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-22 03:41:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-11-22 03:41:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 03:41:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-22 03:41:12,008 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 21 [2024-11-22 03:41:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:12,008 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-22 03:41:12,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:12,009 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-22 03:41:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 03:41:12,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:12,012 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:12,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 03:41:12,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:12,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:12,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:12,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1120707465, now seen corresponding path program 3 times [2024-11-22 03:41:12,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:41:12,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64949865] [2024-11-22 03:41:12,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 03:41:12,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:41:12,242 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 03:41:12,242 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-22 03:41:12,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016168133] [2024-11-22 03:41:12,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 03:41:12,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:12,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 03:41:12,246 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 03:41:12,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 03:41:12,285 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-22 03:41:12,285 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 03:41:12,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 03:41:12,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 03:41:12,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 03:41:12,702 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 03:41:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:41:12,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64949865] [2024-11-22 03:41:12,704 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 03:41:12,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016168133] [2024-11-22 03:41:12,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016168133] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 03:41:12,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 03:41:12,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-22 03:41:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987397470] [2024-11-22 03:41:12,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 03:41:12,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 03:41:12,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:41:12,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 03:41:12,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-22 03:41:12,708 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 18 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:13,103 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2024-11-22 03:41:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 03:41:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-22 03:41:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:13,105 INFO L225 Difference]: With dead ends: 75 [2024-11-22 03:41:13,105 INFO L226 Difference]: Without dead ends: 72 [2024-11-22 03:41:13,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2024-11-22 03:41:13,107 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:13,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 445 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 03:41:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-22 03:41:13,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2024-11-22 03:41:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.196078431372549) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 03:41:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2024-11-22 03:41:13,126 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 23 [2024-11-22 03:41:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:13,126 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2024-11-22 03:41:13,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2024-11-22 03:41:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 03:41:13,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:13,128 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:13,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 03:41:13,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:13,329 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:13,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:13,330 INFO L85 PathProgramCache]: Analyzing trace with hash 469106930, now seen corresponding path program 4 times [2024-11-22 03:41:13,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:41:13,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080733301] [2024-11-22 03:41:13,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 03:41:13,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:41:13,345 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 03:41:13,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 03:41:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:41:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080733301] [2024-11-22 03:41:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080733301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 03:41:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739360059] [2024-11-22 03:41:13,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 03:41:13,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:13,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 03:41:13,466 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 03:41:13,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 03:41:13,510 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 03:41:13,511 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 03:41:13,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 03:41:13,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:13,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 03:41:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:13,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739360059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 03:41:13,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 03:41:13,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-22 03:41:13,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110347150] [2024-11-22 03:41:13,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 03:41:13,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 03:41:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:41:13,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 03:41:13,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2024-11-22 03:41:13,744 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:13,895 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2024-11-22 03:41:13,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 03:41:13,896 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 03:41:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:13,897 INFO L225 Difference]: With dead ends: 90 [2024-11-22 03:41:13,897 INFO L226 Difference]: Without dead ends: 61 [2024-11-22 03:41:13,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2024-11-22 03:41:13,898 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:13,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 509 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 03:41:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-22 03:41:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-22 03:41:13,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 47 states have internal predecessors, (49), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 03:41:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-11-22 03:41:13,903 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 25 [2024-11-22 03:41:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:13,904 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-11-22 03:41:13,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-11-22 03:41:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 03:41:13,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:13,905 INFO L215 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:13,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 03:41:14,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:14,105 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:14,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash -985782289, now seen corresponding path program 5 times [2024-11-22 03:41:14,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:41:14,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565354759] [2024-11-22 03:41:14,106 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 03:41:14,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:41:14,114 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-22 03:41:14,117 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 03:41:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 03:41:14,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:41:14,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565354759] [2024-11-22 03:41:14,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565354759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 03:41:14,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60931532] [2024-11-22 03:41:14,194 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 03:41:14,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:14,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 03:41:14,196 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 03:41:14,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 03:41:14,236 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-22 03:41:14,236 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 03:41:14,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 03:41:14,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:14,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 03:41:14,502 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:14,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60931532] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 03:41:14,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 03:41:14,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 23 [2024-11-22 03:41:14,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800886595] [2024-11-22 03:41:14,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 03:41:14,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-22 03:41:14,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:41:14,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-22 03:41:14,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2024-11-22 03:41:14,504 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:14,588 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2024-11-22 03:41:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 03:41:14,589 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 03:41:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:14,589 INFO L225 Difference]: With dead ends: 67 [2024-11-22 03:41:14,589 INFO L226 Difference]: Without dead ends: 49 [2024-11-22 03:41:14,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-11-22 03:41:14,590 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:14,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 550 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 03:41:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-22 03:41:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-22 03:41:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-22 03:41:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-22 03:41:14,595 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 27 [2024-11-22 03:41:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:14,595 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-22 03:41:14,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-22 03:41:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 03:41:14,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:14,596 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:14,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 03:41:14,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:14,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:14,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:14,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1781630816, now seen corresponding path program 1 times [2024-11-22 03:41:14,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:41:14,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813880424] [2024-11-22 03:41:14,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:14,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:41:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 03:41:14,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1283626919] [2024-11-22 03:41:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:14,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:14,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 03:41:14,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 03:41:14,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 03:41:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:41:14,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 03:41:14,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 03:41:14,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 03:41:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 03:41:15,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 03:41:15,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813880424] [2024-11-22 03:41:15,225 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 03:41:15,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283626919] [2024-11-22 03:41:15,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283626919] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 03:41:15,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 03:41:15,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-11-22 03:41:15,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073505186] [2024-11-22 03:41:15,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 03:41:15,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 03:41:15,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 03:41:15,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 03:41:15,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-22 03:41:15,228 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 03:41:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:15,369 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2024-11-22 03:41:15,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 03:41:15,369 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-22 03:41:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:15,371 INFO L225 Difference]: With dead ends: 49 [2024-11-22 03:41:15,371 INFO L226 Difference]: Without dead ends: 23 [2024-11-22 03:41:15,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-11-22 03:41:15,372 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:15,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 410 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 03:41:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-22 03:41:15,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-22 03:41:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 03:41:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-22 03:41:15,378 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 28 [2024-11-22 03:41:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:15,378 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-22 03:41:15,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 03:41:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-22 03:41:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-22 03:41:15,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:15,380 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:15,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-22 03:41:15,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 03:41:15,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:15,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash -21288017, now seen corresponding path program 1 times [2024-11-22 03:41:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 03:41:15,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866550220] [2024-11-22 03:41:15,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:15,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 03:41:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 03:41:15,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 03:41:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 03:41:15,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 03:41:15,623 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 03:41:15,624 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-22 03:41:15,626 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-22 03:41:15,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 03:41:15,629 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-22 03:41:15,642 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 03:41:15,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 03:41:15 BoogieIcfgContainer [2024-11-22 03:41:15,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 03:41:15,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 03:41:15,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 03:41:15,644 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 03:41:15,645 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:41:10" (3/4) ... [2024-11-22 03:41:15,646 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 03:41:15,647 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 03:41:15,647 INFO L158 Benchmark]: Toolchain (without parser) took 6182.16ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 117.4MB in the beginning and 97.7MB in the end (delta: 19.7MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2024-11-22 03:41:15,648 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory was 81.7MB in the beginning and 81.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 03:41:15,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.00ms. Allocated memory is still 151.0MB. Free memory was 117.4MB in the beginning and 103.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 03:41:15,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.96ms. Allocated memory is still 151.0MB. Free memory was 103.5MB in the beginning and 101.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 03:41:15,648 INFO L158 Benchmark]: Boogie Preprocessor took 36.75ms. Allocated memory is still 151.0MB. Free memory was 101.5MB in the beginning and 99.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 03:41:15,648 INFO L158 Benchmark]: RCFGBuilder took 420.72ms. Allocated memory is still 151.0MB. Free memory was 99.4MB in the beginning and 116.0MB in the end (delta: -16.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 03:41:15,648 INFO L158 Benchmark]: TraceAbstraction took 5425.09ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 115.5MB in the beginning and 97.7MB in the end (delta: 17.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-22 03:41:15,648 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 184.5MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 03:41:15,649 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory was 81.7MB in the beginning and 81.5MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.00ms. Allocated memory is still 151.0MB. Free memory was 117.4MB in the beginning and 103.5MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.96ms. Allocated memory is still 151.0MB. Free memory was 103.5MB in the beginning and 101.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.75ms. Allocated memory is still 151.0MB. Free memory was 101.5MB in the beginning and 99.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 420.72ms. Allocated memory is still 151.0MB. Free memory was 99.4MB in the beginning and 116.0MB in the end (delta: -16.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5425.09ms. Allocated memory was 151.0MB in the beginning and 184.5MB in the end (delta: 33.6MB). Free memory was 115.5MB in the beginning and 97.7MB in the end (delta: 17.8MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 184.5MB. Free memory is still 97.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 109]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 104. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -0.2f && IN < 0.2f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -0.2f && IN < 0.2f) [L100] CALL, EXPR f(IN) VAL [\old(x)=112] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=112] [L100] RET, EXPR f(IN) VAL [IN=112] [L100] CALL, EXPR fp(IN) VAL [\old(x)=112] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=112] [L100] RET, EXPR fp(IN) VAL [IN=112] [L100] float x = IN - f(IN)/fp(IN); [L102] CALL, EXPR f(x) VAL [\old(x)=110] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=110] [L102] RET, EXPR f(x) VAL [IN=112, x=110] [L102] CALL, EXPR fp(x) VAL [\old(x)=110] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=110] [L102] RET, EXPR fp(x) VAL [IN=112, x=110] [L102] x = x - f(x)/fp(x) [L104] CALL, EXPR f(x) VAL [\old(x)=111] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=111] [L104] RET, EXPR f(x) VAL [IN=112, x=111] [L104] CALL, EXPR fp(x) VAL [\old(x)=111] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=111] [L104] RET, EXPR fp(x) VAL [IN=112, x=111] [L104] x = x - f(x)/fp(x) [L108] COND TRUE !(x < 0.1) VAL [IN=112] [L109] reach_error() VAL [IN=112] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 2644 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2283 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 920 IncrementalHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 361 mSDtfsCounter, 920 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=6, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 355 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 392 ConstructedInterpolants, 0 QuantifiedInterpolants, 1983 SizeOfPredicates, 17 NumberOfNonLiveVariables, 549 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 108/420 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 03:41:15,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_4+newton_3_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad6236f3b1535aee53ef497474ba76faac9143455d497d8d917066c0b5859668 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 03:41:17,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 03:41:17,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 03:41:17,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 03:41:17,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 03:41:17,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 03:41:17,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 03:41:17,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 03:41:17,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 03:41:17,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 03:41:17,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 03:41:17,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 03:41:17,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 03:41:17,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 03:41:17,622 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 03:41:17,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 03:41:17,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 03:41:17,623 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 03:41:17,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 03:41:17,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 03:41:17,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 03:41:17,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 03:41:17,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 03:41:17,628 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 03:41:17,628 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 03:41:17,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 03:41:17,628 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 03:41:17,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 03:41:17,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 03:41:17,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 03:41:17,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 03:41:17,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 03:41:17,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 03:41:17,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 03:41:17,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 03:41:17,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 03:41:17,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 03:41:17,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 03:41:17,630 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 03:41:17,630 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 03:41:17,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 03:41:17,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 03:41:17,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 03:41:17,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 03:41:17,634 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 -> ad6236f3b1535aee53ef497474ba76faac9143455d497d8d917066c0b5859668 [2024-11-22 03:41:17,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 03:41:17,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 03:41:17,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 03:41:17,889 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 03:41:17,890 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 03:41:17,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_3_1.i [2024-11-22 03:41:19,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 03:41:19,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 03:41:19,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i [2024-11-22 03:41:19,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9c1d83ad/f08461676289460ca6ca7ee5b291a2b2/FLAGf27c505da [2024-11-22 03:41:19,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9c1d83ad/f08461676289460ca6ca7ee5b291a2b2 [2024-11-22 03:41:19,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 03:41:19,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 03:41:19,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 03:41:19,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 03:41:19,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 03:41:19,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd199a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19, skipping insertion in model container [2024-11-22 03:41:19,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 03:41:19,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[1224,1237] [2024-11-22 03:41:19,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[2848,2861] [2024-11-22 03:41:19,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 03:41:19,502 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 03:41:19,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[1224,1237] [2024-11-22 03:41:19,530 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_1.i[2848,2861] [2024-11-22 03:41:19,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 03:41:19,551 INFO L204 MainTranslator]: Completed translation [2024-11-22 03:41:19,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19 WrapperNode [2024-11-22 03:41:19,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 03:41:19,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 03:41:19,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 03:41:19,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 03:41:19,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,587 INFO L138 Inliner]: procedures = 28, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 81 [2024-11-22 03:41:19,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 03:41:19,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 03:41:19,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 03:41:19,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 03:41:19,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,614 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-22 03:41:19,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 03:41:19,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 03:41:19,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 03:41:19,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 03:41:19,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (1/1) ... [2024-11-22 03:41:19,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 03:41:19,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 03:41:19,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 03:41:19,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 03:41:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 03:41:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 03:41:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 03:41:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-22 03:41:19,695 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-22 03:41:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-22 03:41:19,695 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-22 03:41:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 03:41:19,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 03:41:19,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 03:41:19,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 03:41:19,750 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 03:41:19,751 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 03:41:33,855 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-22 03:41:33,855 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 03:41:33,868 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 03:41:33,868 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 03:41:33,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:41:33 BoogieIcfgContainer [2024-11-22 03:41:33,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 03:41:33,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 03:41:33,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 03:41:33,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 03:41:33,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 03:41:19" (1/3) ... [2024-11-22 03:41:33,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19513162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 03:41:33, skipping insertion in model container [2024-11-22 03:41:33,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:41:19" (2/3) ... [2024-11-22 03:41:33,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19513162 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 03:41:33, skipping insertion in model container [2024-11-22 03:41:33,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:41:33" (3/3) ... [2024-11-22 03:41:33,874 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_1.i [2024-11-22 03:41:33,888 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 03:41:33,888 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 03:41:33,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 03:41:33,938 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;@2a7bc222, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 03:41:33,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 03:41:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 03:41:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 03:41:33,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:33,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:33,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:33,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:33,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1780387208, now seen corresponding path program 1 times [2024-11-22 03:41:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 03:41:33,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23386198] [2024-11-22 03:41:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:33,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:33,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 03:41:33,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 03:41:33,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 03:41:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:41:34,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 03:41:34,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:34,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 03:41:34,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 03:41:34,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23386198] [2024-11-22 03:41:34,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23386198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:41:34,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:41:34,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 03:41:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655557762] [2024-11-22 03:41:34,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:41:34,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 03:41:34,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 03:41:34,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 03:41:34,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:34,199 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 33 states have internal predecessors, (43), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:34,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:34,342 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2024-11-22 03:41:34,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 03:41:34,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 03:41:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:34,351 INFO L225 Difference]: With dead ends: 90 [2024-11-22 03:41:34,351 INFO L226 Difference]: Without dead ends: 42 [2024-11-22 03:41:34,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:34,356 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:34,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 96 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 03:41:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-22 03:41:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-11-22 03:41:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 03:41:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-11-22 03:41:34,386 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2024-11-22 03:41:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:34,386 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-11-22 03:41:34,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:34,387 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-11-22 03:41:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 03:41:34,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:34,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:34,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 03:41:34,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:34,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:34,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash 413718792, now seen corresponding path program 1 times [2024-11-22 03:41:34,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 03:41:34,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386521316] [2024-11-22 03:41:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:34,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:34,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 03:41:34,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 03:41:34,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 03:41:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:41:34,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 03:41:34,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:34,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 03:41:34,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 03:41:34,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386521316] [2024-11-22 03:41:34,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386521316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:41:34,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:41:34,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 03:41:34,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472768784] [2024-11-22 03:41:34,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:41:34,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 03:41:34,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 03:41:34,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 03:41:34,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:34,765 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:34,887 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2024-11-22 03:41:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 03:41:34,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-22 03:41:34,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:34,888 INFO L225 Difference]: With dead ends: 55 [2024-11-22 03:41:34,889 INFO L226 Difference]: Without dead ends: 41 [2024-11-22 03:41:34,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:34,891 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:34,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 03:41:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-22 03:41:34,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-22 03:41:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 03:41:34,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-22 03:41:34,896 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 13 [2024-11-22 03:41:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:34,896 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-22 03:41:34,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-22 03:41:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-22 03:41:34,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:34,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:34,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 03:41:35,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:35,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:35,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1714945339, now seen corresponding path program 1 times [2024-11-22 03:41:35,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 03:41:35,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428939495] [2024-11-22 03:41:35,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:35,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:35,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 03:41:35,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 03:41:35,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 03:41:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:41:35,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 03:41:35,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:35,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 03:41:35,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 03:41:35,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428939495] [2024-11-22 03:41:35,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428939495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:41:35,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:41:35,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 03:41:35,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030782725] [2024-11-22 03:41:35,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:41:35,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 03:41:35,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 03:41:35,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 03:41:35,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:35,490 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:35,628 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-11-22 03:41:35,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 03:41:35,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-22 03:41:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:35,631 INFO L225 Difference]: With dead ends: 56 [2024-11-22 03:41:35,632 INFO L226 Difference]: Without dead ends: 43 [2024-11-22 03:41:35,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:35,633 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:35,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 03:41:35,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-22 03:41:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-22 03:41:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 03:41:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-22 03:41:35,643 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 15 [2024-11-22 03:41:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:35,644 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-22 03:41:35,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-22 03:41:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 03:41:35,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:35,645 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:35,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 03:41:35,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:35,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:35,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:35,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1030187394, now seen corresponding path program 1 times [2024-11-22 03:41:35,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 03:41:35,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031513738] [2024-11-22 03:41:35,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:41:35,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:35,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 03:41:35,848 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 03:41:35,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 03:41:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:41:35,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 03:41:35,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:36,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 03:41:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:36,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 03:41:36,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031513738] [2024-11-22 03:41:36,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031513738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 03:41:36,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 03:41:36,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-22 03:41:36,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207127158] [2024-11-22 03:41:36,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 03:41:36,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 03:41:36,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 03:41:36,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 03:41:36,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 03:41:36,722 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:37,113 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-11-22 03:41:37,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 03:41:37,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-22 03:41:37,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:37,115 INFO L225 Difference]: With dead ends: 60 [2024-11-22 03:41:37,115 INFO L226 Difference]: Without dead ends: 47 [2024-11-22 03:41:37,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 03:41:37,116 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:37,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 03:41:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-22 03:41:37,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-22 03:41:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 03:41:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-22 03:41:37,122 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 17 [2024-11-22 03:41:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:37,122 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-22 03:41:37,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-22 03:41:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 03:41:37,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:37,123 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:37,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 03:41:37,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:37,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:37,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:37,325 INFO L85 PathProgramCache]: Analyzing trace with hash -626272964, now seen corresponding path program 2 times [2024-11-22 03:41:37,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 03:41:37,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128111110] [2024-11-22 03:41:37,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 03:41:37,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:37,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 03:41:37,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 03:41:37,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 03:41:37,388 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 03:41:37,389 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 03:41:37,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 03:41:37,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:39,419 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 03:41:39,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 03:41:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 03:41:45,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 03:41:45,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128111110] [2024-11-22 03:41:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128111110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 03:41:45,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 03:41:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-22 03:41:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568730423] [2024-11-22 03:41:45,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 03:41:45,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 03:41:45,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 03:41:45,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 03:41:45,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-22 03:41:45,507 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:50,252 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2024-11-22 03:41:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 03:41:50,257 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 03:41:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:50,259 INFO L225 Difference]: With dead ends: 71 [2024-11-22 03:41:50,259 INFO L226 Difference]: Without dead ends: 68 [2024-11-22 03:41:50,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-22 03:41:50,260 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:50,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 365 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-22 03:41:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-22 03:41:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-11-22 03:41:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 52 states have internal predecessors, (59), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 03:41:50,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-11-22 03:41:50,271 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 21 [2024-11-22 03:41:50,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:50,271 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-22 03:41:50,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-11-22 03:41:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 03:41:50,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:50,272 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:50,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 03:41:50,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:50,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:50,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:50,474 INFO L85 PathProgramCache]: Analyzing trace with hash -311360839, now seen corresponding path program 3 times [2024-11-22 03:41:50,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 03:41:50,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619791371] [2024-11-22 03:41:50,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 03:41:50,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:50,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 03:41:50,476 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 03:41:50,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 03:41:50,541 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 03:41:50,541 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 03:41:50,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 03:41:50,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 03:41:50,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 03:41:50,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 03:41:50,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619791371] [2024-11-22 03:41:50,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619791371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 03:41:50,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 03:41:50,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 03:41:50,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944912140] [2024-11-22 03:41:50,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 03:41:50,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 03:41:50,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 03:41:50,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 03:41:50,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:50,637 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:50,748 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2024-11-22 03:41:50,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 03:41:50,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-22 03:41:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:50,751 INFO L225 Difference]: With dead ends: 78 [2024-11-22 03:41:50,751 INFO L226 Difference]: Without dead ends: 67 [2024-11-22 03:41:50,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 03:41:50,752 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:50,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 79 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 03:41:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-22 03:41:50,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2024-11-22 03:41:50,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 50 states have internal predecessors, (55), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 03:41:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2024-11-22 03:41:50,764 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 23 [2024-11-22 03:41:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:50,764 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2024-11-22 03:41:50,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:50,764 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2024-11-22 03:41:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 03:41:50,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:50,765 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:50,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-22 03:41:50,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:50,966 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:50,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:50,967 INFO L85 PathProgramCache]: Analyzing trace with hash 603968502, now seen corresponding path program 4 times [2024-11-22 03:41:50,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 03:41:50,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75311296] [2024-11-22 03:41:50,967 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 03:41:50,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:50,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 03:41:50,969 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 03:41:50,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-22 03:41:51,056 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 03:41:51,057 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 03:41:51,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 03:41:51,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:52,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 03:41:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 03:41:54,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 03:41:54,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75311296] [2024-11-22 03:41:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75311296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 03:41:54,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 03:41:54,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-22 03:41:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865712458] [2024-11-22 03:41:54,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 03:41:54,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 03:41:54,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 03:41:54,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 03:41:54,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-22 03:41:54,536 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:57,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:41:57,813 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2024-11-22 03:41:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 03:41:57,818 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 03:41:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:41:57,819 INFO L225 Difference]: With dead ends: 99 [2024-11-22 03:41:57,819 INFO L226 Difference]: Without dead ends: 71 [2024-11-22 03:41:57,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2024-11-22 03:41:57,820 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-22 03:41:57,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 329 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-22 03:41:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-22 03:41:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-22 03:41:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 56 states have internal predecessors, (65), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 03:41:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2024-11-22 03:41:57,831 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 25 [2024-11-22 03:41:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:41:57,831 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2024-11-22 03:41:57,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:41:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2024-11-22 03:41:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 03:41:57,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:41:57,833 INFO L215 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:41:57,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-22 03:41:58,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:58,034 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:41:58,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:41:58,035 INFO L85 PathProgramCache]: Analyzing trace with hash -985782289, now seen corresponding path program 5 times [2024-11-22 03:41:58,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 03:41:58,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158095984] [2024-11-22 03:41:58,035 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 03:41:58,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:41:58,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 03:41:58,041 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 03:41:58,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-22 03:41:58,109 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-22 03:41:58,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 03:41:58,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 03:41:58,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:41:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 03:41:59,230 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 03:42:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 03:42:03,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 03:42:03,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158095984] [2024-11-22 03:42:03,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158095984] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 03:42:03,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 03:42:03,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-11-22 03:42:03,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635524767] [2024-11-22 03:42:03,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 03:42:03,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 03:42:03,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 03:42:03,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 03:42:03,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-22 03:42:03,716 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:42:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:42:07,194 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2024-11-22 03:42:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 03:42:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 03:42:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:42:07,196 INFO L225 Difference]: With dead ends: 104 [2024-11-22 03:42:07,196 INFO L226 Difference]: Without dead ends: 70 [2024-11-22 03:42:07,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2024-11-22 03:42:07,197 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-22 03:42:07,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-22 03:42:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-22 03:42:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-22 03:42:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.169811320754717) internal successors, (62), 56 states have internal predecessors, (62), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 03:42:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2024-11-22 03:42:07,204 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 27 [2024-11-22 03:42:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:42:07,204 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2024-11-22 03:42:07,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 03:42:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2024-11-22 03:42:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 03:42:07,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:42:07,205 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:42:07,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 03:42:07,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:42:07,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:42:07,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:42:07,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1781630816, now seen corresponding path program 1 times [2024-11-22 03:42:07,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 03:42:07,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011051296] [2024-11-22 03:42:07,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:42:07,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:42:07,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 03:42:07,408 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 03:42:07,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-22 03:42:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 03:42:07,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 03:42:07,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 03:42:09,655 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 03:42:09,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 03:42:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 03:42:16,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 03:42:16,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011051296] [2024-11-22 03:42:16,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011051296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 03:42:16,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 03:42:16,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-22 03:42:16,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247270451] [2024-11-22 03:42:16,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 03:42:16,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 03:42:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 03:42:16,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 03:42:16,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-22 03:42:16,020 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 18 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 03:42:20,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 03:42:20,508 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2024-11-22 03:42:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 03:42:20,508 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-22 03:42:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 03:42:20,509 INFO L225 Difference]: With dead ends: 76 [2024-11-22 03:42:20,510 INFO L226 Difference]: Without dead ends: 62 [2024-11-22 03:42:20,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-22 03:42:20,511 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-22 03:42:20,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 399 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-22 03:42:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-22 03:42:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-22 03:42:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-22 03:42:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2024-11-22 03:42:20,518 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 28 [2024-11-22 03:42:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 03:42:20,518 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-11-22 03:42:20,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5) internal successors, (40), 16 states have internal predecessors, (40), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 03:42:20,519 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2024-11-22 03:42:20,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-22 03:42:20,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 03:42:20,520 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 03:42:20,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-22 03:42:20,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:42:20,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 03:42:20,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 03:42:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash -21288017, now seen corresponding path program 1 times [2024-11-22 03:42:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 03:42:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868436548] [2024-11-22 03:42:20,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 03:42:20,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 03:42:20,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 03:42:20,723 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 03:42:20,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process