./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_2_7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_4+newton_2_7.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 5365e3b9adf0a1dadb935cfdb4266af37826f3120fbeff3f7ce577b21fb856a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:44:09,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:44:09,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:44:09,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:44:09,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:44:09,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:44:09,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:44:09,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:44:09,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:44:09,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:44:09,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:44:09,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:44:09,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:44:09,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:44:09,884 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:44:09,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:44:09,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:44:09,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:44:09,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:44:09,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:44:09,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:44:09,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:44:09,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:44:09,889 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:44:09,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:44:09,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:44:09,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:44:09,890 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:44:09,890 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:44:09,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:44:09,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:44:09,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:44:09,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:44:09,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:44:09,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:44:09,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:44:09,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:44:09,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:44:09,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:44:09,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:44:09,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:44:09,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:44:09,894 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 -> 5365e3b9adf0a1dadb935cfdb4266af37826f3120fbeff3f7ce577b21fb856a6 [2024-11-10 00:44:10,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:44:10,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:44:10,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:44:10,158 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:44:10,159 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:44:10,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_2_7.i [2024-11-10 00:44:11,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:44:11,837 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:44:11,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i [2024-11-10 00:44:11,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adfd1251c/23cf042478bb408db996053d1bb0356d/FLAG7e0132b44 [2024-11-10 00:44:11,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adfd1251c/23cf042478bb408db996053d1bb0356d [2024-11-10 00:44:11,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:44:11,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:44:11,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:44:11,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:44:11,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:44:11,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:44:11" (1/1) ... [2024-11-10 00:44:11,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc2218a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:11, skipping insertion in model container [2024-11-10 00:44:11,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:44:11" (1/1) ... [2024-11-10 00:44:11,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:44:12,063 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_2_7.i[1224,1237] [2024-11-10 00:44:12,101 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_2_7.i[2827,2840] [2024-11-10 00:44:12,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:44:12,114 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:44:12,130 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_2_7.i[1224,1237] [2024-11-10 00:44:12,148 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_2_7.i[2827,2840] [2024-11-10 00:44:12,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:44:12,172 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:44:12,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12 WrapperNode [2024-11-10 00:44:12,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:44:12,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:44:12,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:44:12,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:44:12,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,215 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 78 [2024-11-10 00:44:12,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:44:12,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:44:12,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:44:12,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:44:12,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,254 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-10 00:44:12,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:44:12,270 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:44:12,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:44:12,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:44:12,271 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (1/1) ... [2024-11-10 00:44:12,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:44:12,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:44:12,306 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-10 00:44:12,312 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-10 00:44:12,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:44:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-10 00:44:12,358 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-10 00:44:12,358 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-10 00:44:12,359 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-10 00:44:12,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:44:12,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 00:44:12,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:44:12,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:44:12,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 00:44:12,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 00:44:12,437 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:44:12,439 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:44:12,664 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-10 00:44:12,665 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:44:12,681 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:44:12,685 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:44:12,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:44:12 BoogieIcfgContainer [2024-11-10 00:44:12,685 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:44:12,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:44:12,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:44:12,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:44:12,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:44:11" (1/3) ... [2024-11-10 00:44:12,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e3814c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:44:12, skipping insertion in model container [2024-11-10 00:44:12,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:12" (2/3) ... [2024-11-10 00:44:12,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e3814c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:44:12, skipping insertion in model container [2024-11-10 00:44:12,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:44:12" (3/3) ... [2024-11-10 00:44:12,698 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_7.i [2024-11-10 00:44:12,714 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:44:12,715 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:44:12,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:44:12,772 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;@2cebfc9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:44:12,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:44:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 35 states have internal predecessors, (45), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 00:44:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 00:44:12,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:44:12,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:44:12,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:44:12,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:44:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash -166131732, now seen corresponding path program 1 times [2024-11-10 00:44:12,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:44:12,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774878719] [2024-11-10 00:44:12,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:12,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:44:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:44:13,071 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-10 00:44:13,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:44:13,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774878719] [2024-11-10 00:44:13,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774878719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:44:13,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:44:13,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:44:13,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572014656] [2024-11-10 00:44:13,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:44:13,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:44:13,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:44:13,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:44:13,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:44:13,099 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 35 states have internal predecessors, (45), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10 00:44:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:44:13,148 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2024-11-10 00:44:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:44:13,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-10 00:44:13,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:44:13,157 INFO L225 Difference]: With dead ends: 88 [2024-11-10 00:44:13,157 INFO L226 Difference]: Without dead ends: 41 [2024-11-10 00:44:13,160 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-10 00:44:13,164 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:44:13,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 90 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:44:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-10 00:44:13,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-10 00:44:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 00:44:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-10 00:44:13,199 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 12 [2024-11-10 00:44:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:44:13,199 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-10 00:44:13,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10 00:44:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-10 00:44:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 00:44:13,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:44:13,201 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:44:13,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:44:13,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:44:13,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:44:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1576678603, now seen corresponding path program 1 times [2024-11-10 00:44:13,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:44:13,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550903011] [2024-11-10 00:44:13,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:13,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:44:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:44:13,299 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-10 00:44:13,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:44:13,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550903011] [2024-11-10 00:44:13,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550903011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:44:13,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:44:13,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:44:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945769241] [2024-11-10 00:44:13,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:44:13,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:44:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:44:13,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:44:13,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:44:13,304 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10 00:44:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:44:13,332 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2024-11-10 00:44:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:44:13,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-10 00:44:13,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:44:13,334 INFO L225 Difference]: With dead ends: 68 [2024-11-10 00:44:13,334 INFO L226 Difference]: Without dead ends: 48 [2024-11-10 00:44:13,335 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-10 00:44:13,336 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 73 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-10 00:44:13,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 73 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:44:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-10 00:44:13,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2024-11-10 00:44:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 00:44:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-10 00:44:13,371 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 12 [2024-11-10 00:44:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:44:13,371 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-10 00:44:13,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10 00:44:13,371 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-10 00:44:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 00:44:13,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:44:13,372 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:44:13,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:44:13,373 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:44:13,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:44:13,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1982074068, now seen corresponding path program 1 times [2024-11-10 00:44:13,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:44:13,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791973951] [2024-11-10 00:44:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:13,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:44:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:44:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:44:13,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:44:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791973951] [2024-11-10 00:44:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791973951] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:44:13,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402955462] [2024-11-10 00:44:13,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:13,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:44:13,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:44:13,606 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-10 00:44:13,608 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-10 00:44:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:44:13,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 00:44:13,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:44:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:44:13,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 00:44:13,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402955462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:44:13,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 00:44:13,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-10 00:44:13,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263331823] [2024-11-10 00:44:13,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:44:13,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:44:13,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:44:13,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:44:13,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:44:13,793 INFO L87 Difference]: Start difference. First operand 41 states and 47 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-10 00:44:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:44:13,823 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2024-11-10 00:44:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:44:13,824 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 18 [2024-11-10 00:44:13,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:44:13,825 INFO L225 Difference]: With dead ends: 59 [2024-11-10 00:44:13,827 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 00:44:13,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:44:13,829 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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-10 00:44:13,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:44:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 00:44:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-10 00:44:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 00:44:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-10 00:44:13,839 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 18 [2024-11-10 00:44:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:44:13,839 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-10 00:44:13,840 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-10 00:44:13,840 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-10 00:44:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 00:44:13,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:44:13,841 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:44:13,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 00:44:14,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:44:14,042 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:44:14,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:44:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1717449537, now seen corresponding path program 1 times [2024-11-10 00:44:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:44:14,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221776335] [2024-11-10 00:44:14,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:44:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:44:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:44:14,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:44:14,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221776335] [2024-11-10 00:44:14,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221776335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:44:14,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632077383] [2024-11-10 00:44:14,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:14,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:44:14,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:44:14,207 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-10 00:44:14,208 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-10 00:44:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:44:14,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 00:44:14,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:44:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:44:14,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:44:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:44:14,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632077383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:44:14,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:44:14,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-10 00:44:14,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246300577] [2024-11-10 00:44:14,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:44:14,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 00:44:14,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:44:14,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 00:44:14,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:44:14,452 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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-10 00:44:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:44:14,511 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2024-11-10 00:44:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:44:14,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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-10 00:44:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:44:14,513 INFO L225 Difference]: With dead ends: 65 [2024-11-10 00:44:14,513 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 00:44:14,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-10 00:44:14,516 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:44:14,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:44:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 00:44:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 00:44:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 00:44:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-10 00:44:14,529 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 21 [2024-11-10 00:44:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:44:14,529 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-10 00:44:14,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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-10 00:44:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-10 00:44:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 00:44:14,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:44:14,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:44:14,550 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-10 00:44:14,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 00:44:14,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:44:14,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:44:14,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1328884132, now seen corresponding path program 1 times [2024-11-10 00:44:14,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:44:14,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526877856] [2024-11-10 00:44:14,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:14,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:44:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 00:44:14,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 00:44:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 00:44:14,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 00:44:14,770 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 00:44:14,771 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-10 00:44:14,774 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-10 00:44:14,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:44:14,778 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 00:44:14,799 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 00:44:14,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:44:14 BoogieIcfgContainer [2024-11-10 00:44:14,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 00:44:14,804 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 00:44:14,804 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 00:44:14,804 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 00:44:14,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:44:12" (3/4) ... [2024-11-10 00:44:14,807 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 00:44:14,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 00:44:14,808 INFO L158 Benchmark]: Toolchain (without parser) took 2947.36ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 76.1MB in the end (delta: 40.9MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 00:44:14,808 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 176.2MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 00:44:14,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.33ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 103.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 00:44:14,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.80ms. Allocated memory is still 176.2MB. Free memory was 103.3MB in the beginning and 101.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 00:44:14,809 INFO L158 Benchmark]: Boogie Preprocessor took 51.46ms. Allocated memory is still 176.2MB. Free memory was 101.6MB in the beginning and 99.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 00:44:14,809 INFO L158 Benchmark]: IcfgBuilder took 415.78ms. Allocated memory is still 176.2MB. Free memory was 99.5MB in the beginning and 84.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 00:44:14,810 INFO L158 Benchmark]: TraceAbstraction took 2114.56ms. Allocated memory is still 176.2MB. Free memory was 84.0MB in the beginning and 77.1MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 00:44:14,810 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 176.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 00:44:14,812 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.25ms. Allocated memory is still 176.2MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.33ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 103.3MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.80ms. Allocated memory is still 176.2MB. Free memory was 103.3MB in the beginning and 101.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.46ms. Allocated memory is still 176.2MB. Free memory was 101.6MB in the beginning and 99.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 415.78ms. Allocated memory is still 176.2MB. Free memory was 99.5MB in the beginning and 84.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2114.56ms. Allocated memory is still 176.2MB. Free memory was 84.0MB in the beginning and 77.1MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 176.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 102. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -1.4f && IN < 1.4f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -1.4f && IN < 1.4f) [L100] CALL, EXPR f(IN) 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] [L100] RET, EXPR f(IN) VAL [IN=111] [L100] CALL, EXPR fp(IN) 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] [L100] RET, EXPR fp(IN) VAL [IN=111] [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=111, 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=111, x=110] [L102] x = x - f(x)/fp(x) [L108] COND TRUE !(x < 0.1) VAL [IN=111] [L109] reach_error() VAL [IN=111] - 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: 2.0s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 162 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, InterpolantAutomatonStates: 14, 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, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 354 SizeOfPredicates, 4 NumberOfNonLiveVariables, 163 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 10/25 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-10 00:44:14,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_4+newton_2_7.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 5365e3b9adf0a1dadb935cfdb4266af37826f3120fbeff3f7ce577b21fb856a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:44:17,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:44:17,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 00:44:17,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:44:17,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:44:17,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:44:17,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:44:17,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:44:17,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:44:17,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:44:17,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:44:17,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:44:17,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:44:17,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:44:17,179 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:44:17,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:44:17,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:44:17,180 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:44:17,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:44:17,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:44:17,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:44:17,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:44:17,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:44:17,183 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 00:44:17,184 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 00:44:17,184 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:44:17,184 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 00:44:17,184 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:44:17,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:44:17,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:44:17,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:44:17,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:44:17,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:44:17,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:44:17,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:44:17,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:44:17,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:44:17,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:44:17,188 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 00:44:17,188 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 00:44:17,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:44:17,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:44:17,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:44:17,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:44:17,189 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 -> 5365e3b9adf0a1dadb935cfdb4266af37826f3120fbeff3f7ce577b21fb856a6 [2024-11-10 00:44:17,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:44:17,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:44:17,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:44:17,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:44:17,557 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:44:17,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_2_7.i [2024-11-10 00:44:19,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:44:19,420 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:44:19,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_7.i [2024-11-10 00:44:19,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a10f41c0/edd99a79dc8a4fba9b0eb06476030c21/FLAG57ac6b6ca [2024-11-10 00:44:19,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a10f41c0/edd99a79dc8a4fba9b0eb06476030c21 [2024-11-10 00:44:19,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:44:19,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:44:19,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:44:19,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:44:19,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:44:19,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@792f7b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19, skipping insertion in model container [2024-11-10 00:44:19,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:44:19,687 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_2_7.i[1224,1237] [2024-11-10 00:44:19,722 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_2_7.i[2827,2840] [2024-11-10 00:44:19,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:44:19,747 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:44:19,765 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_2_7.i[1224,1237] [2024-11-10 00:44:19,779 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_2_7.i[2827,2840] [2024-11-10 00:44:19,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:44:19,802 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:44:19,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19 WrapperNode [2024-11-10 00:44:19,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:44:19,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:44:19,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:44:19,804 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:44:19,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,861 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 75 [2024-11-10 00:44:19,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:44:19,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:44:19,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:44:19,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:44:19,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,896 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-10 00:44:19,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:44:19,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:44:19,924 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:44:19,924 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:44:19,928 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (1/1) ... [2024-11-10 00:44:19,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:44:19,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:44:19,961 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-10 00:44:19,966 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-10 00:44:19,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:44:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 00:44:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 00:44:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-10 00:44:20,000 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-10 00:44:20,000 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-10 00:44:20,000 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-10 00:44:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:44:20,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:44:20,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 00:44:20,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 00:44:20,071 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:44:20,074 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:44:31,322 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 00:44:31,322 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:44:31,333 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:44:31,334 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:44:31,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:44:31 BoogieIcfgContainer [2024-11-10 00:44:31,334 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:44:31,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:44:31,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:44:31,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:44:31,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:44:19" (1/3) ... [2024-11-10 00:44:31,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ec25de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:44:31, skipping insertion in model container [2024-11-10 00:44:31,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:44:19" (2/3) ... [2024-11-10 00:44:31,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ec25de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:44:31, skipping insertion in model container [2024-11-10 00:44:31,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:44:31" (3/3) ... [2024-11-10 00:44:31,343 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_7.i [2024-11-10 00:44:31,357 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:44:31,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:44:31,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:44:31,422 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;@53c2d21c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:44:31,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:44:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 35 states have internal predecessors, (45), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-10 00:44:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 00:44:31,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:44:31,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:44:31,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:44:31,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:44:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash -166131732, now seen corresponding path program 1 times [2024-11-10 00:44:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 00:44:31,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77994497] [2024-11-10 00:44:31,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:31,461 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-10 00:44:31,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 00:44:31,464 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-10 00:44:31,466 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-10 00:44:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:44:31,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 00:44:31,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:44:31,717 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-10 00:44:31,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 00:44:31,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 00:44:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77994497] [2024-11-10 00:44:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77994497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:44:31,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:44:31,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:44:31,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858717507] [2024-11-10 00:44:31,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:44:31,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:44:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 00:44:31,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:44:31,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:44:31,749 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 35 states have internal predecessors, (45), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10 00:44:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:44:31,935 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2024-11-10 00:44:31,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:44:31,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-11-10 00:44:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:44:31,946 INFO L225 Difference]: With dead ends: 90 [2024-11-10 00:44:31,947 INFO L226 Difference]: Without dead ends: 42 [2024-11-10 00:44:31,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-10 00:44:31,956 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 90 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.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:44:31,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 90 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:44:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-10 00:44:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-11-10 00:44:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 00:44:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-10 00:44:31,998 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 12 [2024-11-10 00:44:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:44:31,999 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-10 00:44:32,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-10 00:44:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-10 00:44:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 00:44:32,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:44:32,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:44:32,010 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-10 00:44:32,203 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-10 00:44:32,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:44:32,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:44:32,205 INFO L85 PathProgramCache]: Analyzing trace with hash -558233601, now seen corresponding path program 1 times [2024-11-10 00:44:32,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 00:44:32,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594096350] [2024-11-10 00:44:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:32,206 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-10 00:44:32,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 00:44:32,210 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-10 00:44:32,211 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-10 00:44:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:44:32,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 00:44:32,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:44:32,392 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-10 00:44:32,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 00:44:32,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 00:44:32,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594096350] [2024-11-10 00:44:32,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594096350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:44:32,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:44:32,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:44:32,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518746640] [2024-11-10 00:44:32,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:44:32,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:44:32,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 00:44:32,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:44:32,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:44:32,400 INFO L87 Difference]: Start difference. First operand 38 states and 44 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-10 00:44:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:44:32,533 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-11-10 00:44:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:44:32,534 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-10 00:44:32,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:44:32,535 INFO L225 Difference]: With dead ends: 57 [2024-11-10 00:44:32,535 INFO L226 Difference]: Without dead ends: 41 [2024-11-10 00:44:32,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-10 00:44:32,537 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 73 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-10 00:44:32,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 73 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:44:32,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-10 00:44:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-10 00:44:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 00:44:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-10 00:44:32,544 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 15 [2024-11-10 00:44:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:44:32,545 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-10 00:44:32,545 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-10 00:44:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-10 00:44:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-10 00:44:32,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:44:32,546 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:44:32,552 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-10 00:44:32,747 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-10 00:44:32,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:44:32,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:44:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1982074068, now seen corresponding path program 1 times [2024-11-10 00:44:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 00:44:32,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074842965] [2024-11-10 00:44:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:32,749 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-10 00:44:32,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 00:44:32,752 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-10 00:44:32,753 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-10 00:44:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:44:32,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 00:44:32,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:44:33,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:44:33,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 00:44:33,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 00:44:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074842965] [2024-11-10 00:44:33,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074842965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:44:33,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:44:33,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:44:33,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352907628] [2024-11-10 00:44:33,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:44:33,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:44:33,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 00:44:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:44:33,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:44:33,265 INFO L87 Difference]: Start difference. First operand 41 states and 47 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-10 00:44:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:44:33,409 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2024-11-10 00:44:33,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:44:33,410 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 18 [2024-11-10 00:44:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:44:33,411 INFO L225 Difference]: With dead ends: 59 [2024-11-10 00:44:33,411 INFO L226 Difference]: Without dead ends: 44 [2024-11-10 00:44:33,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-10 00:44:33,412 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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-10 00:44:33,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:44:33,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-10 00:44:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-10 00:44:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 00:44:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-10 00:44:33,420 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 18 [2024-11-10 00:44:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:44:33,420 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-10 00:44:33,420 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-10 00:44:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-10 00:44:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 00:44:33,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:44:33,422 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:44:33,431 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 (4)] Ended with exit code 0 [2024-11-10 00:44:33,622 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-10 00:44:33,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:44:33,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:44:33,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1717449537, now seen corresponding path program 1 times [2024-11-10 00:44:33,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 00:44:33,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545449478] [2024-11-10 00:44:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:33,624 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-10 00:44:33,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 00:44:33,626 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-10 00:44:33,627 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-10 00:44:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:44:33,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 00:44:33,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:44:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:44:34,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:44:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:44:34,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 00:44:34,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545449478] [2024-11-10 00:44:34,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545449478] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:44:34,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 00:44:34,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-10 00:44:34,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104000604] [2024-11-10 00:44:34,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 00:44:34,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 00:44:34,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 00:44:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 00:44:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:44:34,772 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-10 00:44:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:44:35,077 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2024-11-10 00:44:35,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:44:35,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-10 00:44:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:44:35,078 INFO L225 Difference]: With dead ends: 65 [2024-11-10 00:44:35,079 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 00:44:35,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 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-10 00:44:35,080 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 00:44:35,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 00:44:35,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 00:44:35,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 00:44:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.131578947368421) internal successors, (43), 40 states have internal predecessors, (43), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 00:44:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2024-11-10 00:44:35,093 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 21 [2024-11-10 00:44:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:44:35,093 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2024-11-10 00:44:35,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 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-10 00:44:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2024-11-10 00:44:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 00:44:35,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:44:35,096 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:44:35,104 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-10 00:44:35,296 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-10 00:44:35,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:44:35,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:44:35,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1328884132, now seen corresponding path program 1 times [2024-11-10 00:44:35,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 00:44:35,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532537577] [2024-11-10 00:44:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:44:35,298 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-10 00:44:35,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 00:44:35,301 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-10 00:44:35,302 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