./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_3.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 a8b52922fdfe93dd417523e4e63c80c50c6631dbe5ff22aa1a5e25c09a617278 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 23:43:29,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 23:43:29,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 23:43:29,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 23:43:29,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 23:43:29,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 23:43:29,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 23:43:29,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 23:43:29,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 23:43:29,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 23:43:29,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 23:43:29,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 23:43:29,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 23:43:29,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 23:43:29,678 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 23:43:29,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 23:43:29,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 23:43:29,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 23:43:29,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 23:43:29,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 23:43:29,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 23:43:29,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 23:43:29,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 23:43:29,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 23:43:29,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 23:43:29,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 23:43:29,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 23:43:29,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 23:43:29,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 23:43:29,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 23:43:29,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 23:43:29,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 23:43:29,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:43:29,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 23:43:29,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 23:43:29,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 23:43:29,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 23:43:29,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 23:43:29,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 23:43:29,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 23:43:29,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 23:43:29,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 23:43:29,687 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 -> a8b52922fdfe93dd417523e4e63c80c50c6631dbe5ff22aa1a5e25c09a617278 [2024-11-19 23:43:29,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 23:43:29,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 23:43:29,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 23:43:29,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 23:43:29,910 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 23:43:29,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_3.i [2024-11-19 23:43:31,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 23:43:31,350 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 23:43:31,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_3.i [2024-11-19 23:43:31,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a35f8dc/6e84e609db0946ffac2e76a92339a116/FLAGbb0044b58 [2024-11-19 23:43:31,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0a35f8dc/6e84e609db0946ffac2e76a92339a116 [2024-11-19 23:43:31,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 23:43:31,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 23:43:31,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 23:43:31,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 23:43:31,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 23:43:31,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:43:31" (1/1) ... [2024-11-19 23:43:31,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d26cc06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:31, skipping insertion in model container [2024-11-19 23:43:31,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:43:31" (1/1) ... [2024-11-19 23:43:31,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 23:43:31,940 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_3.i[1224,1237] [2024-11-19 23:43:31,966 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_3.i[2827,2840] [2024-11-19 23:43:31,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:43:31,979 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 23:43:31,991 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_3.i[1224,1237] [2024-11-19 23:43:32,002 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_3.i[2827,2840] [2024-11-19 23:43:32,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:43:32,020 INFO L204 MainTranslator]: Completed translation [2024-11-19 23:43:32,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32 WrapperNode [2024-11-19 23:43:32,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 23:43:32,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 23:43:32,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 23:43:32,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 23:43:32,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,070 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 79 [2024-11-19 23:43:32,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 23:43:32,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 23:43:32,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 23:43:32,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 23:43:32,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,089 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-19 23:43:32,090 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 23:43:32,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 23:43:32,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 23:43:32,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 23:43:32,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (1/1) ... [2024-11-19 23:43:32,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:43:32,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 23:43:32,149 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-19 23:43:32,154 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-19 23:43:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 23:43:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-19 23:43:32,191 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-19 23:43:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-19 23:43:32,191 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-19 23:43:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 23:43:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 23:43:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 23:43:32,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 23:43:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 23:43:32,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 23:43:32,244 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 23:43:32,246 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 23:43:32,402 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-19 23:43:32,402 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 23:43:32,413 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 23:43:32,414 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 23:43:32,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:43:32 BoogieIcfgContainer [2024-11-19 23:43:32,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 23:43:32,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 23:43:32,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 23:43:32,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 23:43:32,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:43:31" (1/3) ... [2024-11-19 23:43:32,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11817156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:43:32, skipping insertion in model container [2024-11-19 23:43:32,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:32" (2/3) ... [2024-11-19 23:43:32,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11817156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:43:32, skipping insertion in model container [2024-11-19 23:43:32,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:43:32" (3/3) ... [2024-11-19 23:43:32,421 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_3.i [2024-11-19 23:43:32,433 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 23:43:32,434 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 23:43:32,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 23:43:32,480 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;@f35ae7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 23:43:32,481 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 23:43:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 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-19 23:43:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 23:43:32,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:43:32,493 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:43:32,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:43:32,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:43:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1780479560, now seen corresponding path program 1 times [2024-11-19 23:43:32,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:43:32,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425721077] [2024-11-19 23:43:32,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:43:32,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:43:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:43:32,746 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-19 23:43:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:43:32,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425721077] [2024-11-19 23:43:32,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425721077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:43:32,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:43:32,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:43:32,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608831302] [2024-11-19 23:43:32,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:43:32,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:43:32,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:43:32,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:43:32,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:43:32,775 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 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.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:32,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:43:32,821 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2024-11-19 23:43:32,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:43:32,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 23:43:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:43:32,836 INFO L225 Difference]: With dead ends: 84 [2024-11-19 23:43:32,836 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 23:43:32,842 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-19 23:43:32,844 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 23:43:32,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:43:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 23:43:32,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-19 23:43:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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-19 23:43:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-19 23:43:32,920 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2024-11-19 23:43:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:43:32,921 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-19 23:43:32,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:32,921 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-19 23:43:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 23:43:32,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:43:32,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:43:32,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 23:43:32,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:43:32,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:43:32,924 INFO L85 PathProgramCache]: Analyzing trace with hash 413626440, now seen corresponding path program 1 times [2024-11-19 23:43:32,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:43:32,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754142926] [2024-11-19 23:43:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:43:32,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:43:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:43:33,009 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-19 23:43:33,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:43:33,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754142926] [2024-11-19 23:43:33,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754142926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:43:33,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:43:33,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:43:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149463578] [2024-11-19 23:43:33,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:43:33,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:43:33,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:43:33,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:43:33,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:43:33,012 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:43:33,025 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2024-11-19 23:43:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:43:33,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 23:43:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:43:33,026 INFO L225 Difference]: With dead ends: 52 [2024-11-19 23:43:33,026 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 23:43:33,027 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-19 23:43:33,028 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 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-19 23:43:33,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:43:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 23:43:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 23:43:33,032 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-19 23:43:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-19 23:43:33,033 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 13 [2024-11-19 23:43:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:43:33,033 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-19 23:43:33,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-19 23:43:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 23:43:33,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:43:33,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:43:33,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 23:43:33,034 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:43:33,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:43:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1715037691, now seen corresponding path program 1 times [2024-11-19 23:43:33,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:43:33,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916877465] [2024-11-19 23:43:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:43:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:43:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:43:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:43:33,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:43:33,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916877465] [2024-11-19 23:43:33,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916877465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:43:33,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:43:33,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:43:33,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426928676] [2024-11-19 23:43:33,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:43:33,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:43:33,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:43:33,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:43:33,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:43:33,127 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-19 23:43:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:43:33,153 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2024-11-19 23:43:33,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:43:33,154 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-19 23:43:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:43:33,155 INFO L225 Difference]: With dead ends: 53 [2024-11-19 23:43:33,155 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 23:43:33,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:43:33,156 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-19 23:43:33,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:43:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 23:43:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 23:43:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 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-19 23:43:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-19 23:43:33,163 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2024-11-19 23:43:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:43:33,163 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-19 23:43:33,163 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-19 23:43:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-19 23:43:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 23:43:33,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:43:33,164 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:43:33,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 23:43:33,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:43:33,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:43:33,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1030095042, now seen corresponding path program 1 times [2024-11-19 23:43:33,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:43:33,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546746362] [2024-11-19 23:43:33,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:43:33,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:43:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:43:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:43:33,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:43:33,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546746362] [2024-11-19 23:43:33,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546746362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 23:43:33,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259803498] [2024-11-19 23:43:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:43:33,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 23:43:33,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 23:43:33,314 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-19 23:43:33,315 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-19 23:43:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:43:33,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 23:43:33,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 23:43:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:43:33,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 23:43:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:43:33,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259803498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 23:43:33,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 23:43:33,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-19 23:43:33,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783323669] [2024-11-19 23:43:33,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 23:43:33,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 23:43:33,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:43:33,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 23:43:33,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-19 23:43:33,507 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:33,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:43:33,557 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-11-19 23:43:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 23:43:33,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 23:43:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:43:33,559 INFO L225 Difference]: With dead ends: 57 [2024-11-19 23:43:33,560 INFO L226 Difference]: Without dead ends: 44 [2024-11-19 23:43:33,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 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-19 23:43:33,562 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 23:43:33,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 23:43:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-19 23:43:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-19 23:43:33,570 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-19 23:43:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-19 23:43:33,571 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 17 [2024-11-19 23:43:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:43:33,571 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-19 23:43:33,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-19 23:43:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 23:43:33,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:43:33,572 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:43:33,582 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-19 23:43:33,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 23:43:33,777 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:43:33,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:43:33,778 INFO L85 PathProgramCache]: Analyzing trace with hash -626365316, now seen corresponding path program 2 times [2024-11-19 23:43:33,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:43:33,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376346346] [2024-11-19 23:43:33,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:43:33,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:43:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:43:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:43:33,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 23:43:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376346346] [2024-11-19 23:43:33,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376346346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 23:43:33,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760482917] [2024-11-19 23:43:33,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 23:43:33,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 23:43:33,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 23:43:33,887 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-19 23:43:33,890 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-19 23:43:33,936 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 23:43:33,936 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 23:43:33,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 23:43:33,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 23:43:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:43:34,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 23:43:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:43:34,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760482917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 23:43:34,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 23:43:34,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-19 23:43:34,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693000517] [2024-11-19 23:43:34,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 23:43:34,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 23:43:34,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 23:43:34,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 23:43:34,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-11-19 23:43:34,077 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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-19 23:43:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:43:34,158 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2024-11-19 23:43:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 23:43:34,159 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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-19 23:43:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:43:34,160 INFO L225 Difference]: With dead ends: 65 [2024-11-19 23:43:34,160 INFO L226 Difference]: Without dead ends: 50 [2024-11-19 23:43:34,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2024-11-19 23:43:34,161 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 23:43:34,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 285 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:43:34,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-19 23:43:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-19 23:43:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 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-19 23:43:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-11-19 23:43:34,166 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 21 [2024-11-19 23:43:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:43:34,166 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-11-19 23:43:34,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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-19 23:43:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-11-19 23:43:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 23:43:34,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:43:34,167 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-19 23:43:34,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 23:43:34,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 23:43:34,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:43:34,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:43:34,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2101905688, now seen corresponding path program 1 times [2024-11-19 23:43:34,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 23:43:34,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999836601] [2024-11-19 23:43:34,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:43:34,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 23:43:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 23:43:34,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 23:43:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 23:43:34,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 23:43:34,400 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 23:43:34,401 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-19 23:43:34,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-19 23:43:34,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 23:43:34,405 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-11-19 23:43:34,418 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 23:43:34,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:43:34 BoogieIcfgContainer [2024-11-19 23:43:34,421 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 23:43:34,421 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 23:43:34,422 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 23:43:34,423 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 23:43:34,423 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:43:32" (3/4) ... [2024-11-19 23:43:34,425 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 23:43:34,426 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 23:43:34,426 INFO L158 Benchmark]: Toolchain (without parser) took 2668.02ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 103.6MB in the beginning and 85.0MB in the end (delta: 18.6MB). Peak memory consumption was 80.7MB. Max. memory is 16.1GB. [2024-11-19 23:43:34,426 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 23:43:34,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.85ms. Allocated memory is still 176.2MB. Free memory was 103.4MB in the beginning and 89.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 23:43:34,427 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.38ms. Allocated memory is still 176.2MB. Free memory was 89.8MB in the beginning and 144.9MB in the end (delta: -55.1MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-11-19 23:43:34,427 INFO L158 Benchmark]: Boogie Preprocessor took 26.84ms. Allocated memory is still 176.2MB. Free memory was 144.9MB in the beginning and 142.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 23:43:34,427 INFO L158 Benchmark]: RCFGBuilder took 315.66ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 142.7MB in the beginning and 197.0MB in the end (delta: -54.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 23:43:34,427 INFO L158 Benchmark]: TraceAbstraction took 2004.68ms. Allocated memory is still 239.1MB. Free memory was 197.0MB in the beginning and 86.0MB in the end (delta: 110.9MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. [2024-11-19 23:43:34,429 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 239.1MB. Free memory was 86.0MB in the beginning and 85.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 23:43:34,430 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.85ms. Allocated memory is still 176.2MB. Free memory was 103.4MB in the beginning and 89.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.38ms. Allocated memory is still 176.2MB. Free memory was 89.8MB in the beginning and 144.9MB in the end (delta: -55.1MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.84ms. Allocated memory is still 176.2MB. Free memory was 144.9MB in the beginning and 142.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 315.66ms. Allocated memory was 176.2MB in the beginning and 239.1MB in the end (delta: 62.9MB). Free memory was 142.7MB in the beginning and 197.0MB in the end (delta: -54.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2004.68ms. Allocated memory is still 239.1MB. Free memory was 197.0MB in the beginning and 86.0MB in the end (delta: 110.9MB). Peak memory consumption was 108.8MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 239.1MB. Free memory was 86.0MB in the beginning and 85.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 > -0.6f && IN < 0.6f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -0.6f && IN < 0.6f) [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, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 636 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 447 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 167 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 189 mSDtfsCounter, 167 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=5, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 513 SizeOfPredicates, 5 NumberOfNonLiveVariables, 168 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 29/61 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-19 23:43:34,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_3.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 a8b52922fdfe93dd417523e4e63c80c50c6631dbe5ff22aa1a5e25c09a617278 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 23:43:36,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 23:43:36,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 23:43:36,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 23:43:36,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 23:43:36,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 23:43:36,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 23:43:36,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 23:43:36,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 23:43:36,887 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 23:43:36,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 23:43:36,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 23:43:36,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 23:43:36,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 23:43:36,889 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 23:43:36,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 23:43:36,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 23:43:36,890 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 23:43:36,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 23:43:36,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 23:43:36,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 23:43:36,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 23:43:36,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 23:43:36,891 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 23:43:36,892 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 23:43:36,892 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 23:43:36,892 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 23:43:36,892 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 23:43:36,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 23:43:36,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 23:43:36,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 23:43:36,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 23:43:36,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 23:43:36,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 23:43:36,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:43:36,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 23:43:36,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 23:43:36,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 23:43:36,895 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 23:43:36,895 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 23:43:36,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 23:43:36,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 23:43:36,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 23:43:36,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 23:43:36,900 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 -> a8b52922fdfe93dd417523e4e63c80c50c6631dbe5ff22aa1a5e25c09a617278 [2024-11-19 23:43:37,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 23:43:37,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 23:43:37,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 23:43:37,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 23:43:37,198 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 23:43:37,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_3.i [2024-11-19 23:43:38,550 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 23:43:38,775 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 23:43:38,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_2_3.i [2024-11-19 23:43:38,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b53f212/235de1c4f5d443159bc7feae66fee9d4/FLAG92dbbab29 [2024-11-19 23:43:38,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55b53f212/235de1c4f5d443159bc7feae66fee9d4 [2024-11-19 23:43:38,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 23:43:38,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 23:43:38,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 23:43:38,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 23:43:38,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 23:43:38,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:43:38" (1/1) ... [2024-11-19 23:43:38,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365b3878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:38, skipping insertion in model container [2024-11-19 23:43:38,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:43:38" (1/1) ... [2024-11-19 23:43:38,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 23:43:39,040 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_3.i[1224,1237] [2024-11-19 23:43:39,064 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_3.i[2827,2840] [2024-11-19 23:43:39,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:43:39,079 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 23:43:39,088 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_3.i[1224,1237] [2024-11-19 23:43:39,100 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_3.i[2827,2840] [2024-11-19 23:43:39,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 23:43:39,117 INFO L204 MainTranslator]: Completed translation [2024-11-19 23:43:39,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39 WrapperNode [2024-11-19 23:43:39,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 23:43:39,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 23:43:39,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 23:43:39,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 23:43:39,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,153 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 76 [2024-11-19 23:43:39,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 23:43:39,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 23:43:39,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 23:43:39,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 23:43:39,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,179 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-19 23:43:39,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 23:43:39,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 23:43:39,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 23:43:39,224 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 23:43:39,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (1/1) ... [2024-11-19 23:43:39,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 23:43:39,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 23:43:39,277 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-19 23:43:39,280 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-19 23:43:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 23:43:39,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 23:43:39,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 23:43:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-19 23:43:39,314 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-19 23:43:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-19 23:43:39,314 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-19 23:43:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 23:43:39,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 23:43:39,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 23:43:39,315 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 23:43:39,373 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 23:43:39,376 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 23:43:50,803 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-19 23:43:50,803 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 23:43:50,816 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 23:43:50,816 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 23:43:50,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:43:50 BoogieIcfgContainer [2024-11-19 23:43:50,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 23:43:50,819 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 23:43:50,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 23:43:50,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 23:43:50,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:43:38" (1/3) ... [2024-11-19 23:43:50,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451402fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:43:50, skipping insertion in model container [2024-11-19 23:43:50,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:43:39" (2/3) ... [2024-11-19 23:43:50,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451402fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:43:50, skipping insertion in model container [2024-11-19 23:43:50,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:43:50" (3/3) ... [2024-11-19 23:43:50,831 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_2_3.i [2024-11-19 23:43:50,851 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 23:43:50,852 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 23:43:50,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 23:43:50,919 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;@cabbc12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 23:43:50,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 23:43:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 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-19 23:43:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 23:43:50,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:43:50,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:43:50,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:43:50,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:43:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1780479560, now seen corresponding path program 1 times [2024-11-19 23:43:50,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 23:43:50,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769863505] [2024-11-19 23:43:50,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:43:50,949 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-19 23:43:50,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 23:43:50,954 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-19 23:43:50,955 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-19 23:43:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:43:51,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 23:43:51,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 23:43:51,146 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-19 23:43:51,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 23:43:51,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 23:43:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769863505] [2024-11-19 23:43:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769863505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:43:51,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:43:51,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:43:51,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398582389] [2024-11-19 23:43:51,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:43:51,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:43:51,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 23:43:51,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:43:51,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:43:51,178 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 32 states have internal predecessors, (42), 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.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:43:51,299 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2024-11-19 23:43:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:43:51,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-19 23:43:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:43:51,306 INFO L225 Difference]: With dead ends: 84 [2024-11-19 23:43:51,306 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 23:43:51,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:43:51,311 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 86 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-19 23:43:51,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:43:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 23:43:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-19 23:43:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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-19 23:43:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-19 23:43:51,337 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 11 [2024-11-19 23:43:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:43:51,337 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-19 23:43:51,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-19 23:43:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 23:43:51,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:43:51,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:43:51,349 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-19 23:43:51,539 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-19 23:43:51,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:43:51,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:43:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash 413626440, now seen corresponding path program 1 times [2024-11-19 23:43:51,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 23:43:51,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911055739] [2024-11-19 23:43:51,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:43:51,542 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-19 23:43:51,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 23:43:51,545 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-19 23:43:51,546 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-19 23:43:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:43:51,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 23:43:51,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 23:43:51,689 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-19 23:43:51,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 23:43:51,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 23:43:51,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911055739] [2024-11-19 23:43:51,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911055739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:43:51,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:43:51,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:43:51,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14464692] [2024-11-19 23:43:51,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:43:51,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:43:51,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 23:43:51,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:43:51,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:43:51,693 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:43:51,813 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2024-11-19 23:43:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:43:51,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-19 23:43:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:43:51,814 INFO L225 Difference]: With dead ends: 52 [2024-11-19 23:43:51,814 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 23:43:51,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:43:51,815 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 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-19 23:43:51,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:43:51,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 23:43:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 23:43:51,820 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-19 23:43:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-19 23:43:51,821 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 13 [2024-11-19 23:43:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:43:51,821 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-19 23:43:51,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-19 23:43:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 23:43:51,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:43:51,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:43:51,830 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 (3)] Ended with exit code 0 [2024-11-19 23:43:52,022 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-19 23:43:52,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:43:52,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:43:52,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1715037691, now seen corresponding path program 1 times [2024-11-19 23:43:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 23:43:52,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000672298] [2024-11-19 23:43:52,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:43:52,026 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-19 23:43:52,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 23:43:52,028 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-19 23:43:52,029 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-19 23:43:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:43:52,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 23:43:52,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 23:43:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:43:52,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 23:43:52,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 23:43:52,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000672298] [2024-11-19 23:43:52,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000672298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 23:43:52,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 23:43:52,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 23:43:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773202388] [2024-11-19 23:43:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 23:43:52,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 23:43:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 23:43:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 23:43:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:43:52,369 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-19 23:43:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:43:52,489 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2024-11-19 23:43:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 23:43:52,489 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-19 23:43:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:43:52,490 INFO L225 Difference]: With dead ends: 53 [2024-11-19 23:43:52,490 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 23:43:52,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 23:43:52,493 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-19 23:43:52,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 23:43:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 23:43:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 23:43:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 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-19 23:43:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-19 23:43:52,498 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 15 [2024-11-19 23:43:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:43:52,499 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-19 23:43:52,499 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-19 23:43:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-19 23:43:52,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 23:43:52,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:43:52,500 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:43:52,505 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-19 23:43:52,700 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-19 23:43:52,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:43:52,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:43:52,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1030095042, now seen corresponding path program 1 times [2024-11-19 23:43:52,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 23:43:52,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097944536] [2024-11-19 23:43:52,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:43:52,702 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-19 23:43:52,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 23:43:52,707 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-19 23:43:52,711 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-19 23:43:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 23:43:52,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 23:43:52,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 23:43:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:43:53,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 23:43:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 23:43:53,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 23:43:53,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097944536] [2024-11-19 23:43:53,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097944536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 23:43:53,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 23:43:53,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 23:43:53,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819575760] [2024-11-19 23:43:53,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 23:43:53,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 23:43:53,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 23:43:53,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 23:43:53,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 23:43:53,478 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:53,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:43:53,794 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-11-19 23:43:53,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 23:43:53,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-19 23:43:53,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:43:53,796 INFO L225 Difference]: With dead ends: 57 [2024-11-19 23:43:53,796 INFO L226 Difference]: Without dead ends: 44 [2024-11-19 23:43:53,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 23:43:53,797 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 23:43:53,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 23:43:53,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-19 23:43:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-19 23:43:53,801 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-19 23:43:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-19 23:43:53,802 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 17 [2024-11-19 23:43:53,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:43:53,802 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-19 23:43:53,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:43:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-19 23:43:53,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 23:43:53,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:43:53,803 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 23:43:53,813 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 (5)] Ended with exit code 0 [2024-11-19 23:43:54,003 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-19 23:43:54,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:43:54,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:43:54,005 INFO L85 PathProgramCache]: Analyzing trace with hash -626365316, now seen corresponding path program 2 times [2024-11-19 23:43:54,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 23:43:54,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055545511] [2024-11-19 23:43:54,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 23:43:54,005 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-19 23:43:54,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 23:43:54,007 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-19 23:43:54,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 23:43:54,060 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 23:43:54,061 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 23:43:54,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 23:43:54,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 23:43:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 23:43:55,858 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 23:44:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 23:44:01,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 23:44:01,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055545511] [2024-11-19 23:44:01,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055545511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 23:44:01,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 23:44:01,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-19 23:44:01,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068013835] [2024-11-19 23:44:01,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 23:44:01,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 23:44:01,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 23:44:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 23:44:01,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-19 23:44:01,111 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:44:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 23:44:05,537 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2024-11-19 23:44:05,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 23:44:05,543 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-19 23:44:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 23:44:05,544 INFO L225 Difference]: With dead ends: 68 [2024-11-19 23:44:05,544 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 23:44:05,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-19 23:44:05,545 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 23:44:05,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 390 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 23:44:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 23:44:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-19 23:44:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 51 states have internal predecessors, (58), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 23:44:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2024-11-19 23:44:05,554 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 21 [2024-11-19 23:44:05,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 23:44:05,554 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2024-11-19 23:44:05,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 23:44:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2024-11-19 23:44:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 23:44:05,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 23:44:05,556 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-19 23:44:05,566 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 (6)] Forceful destruction successful, exit code 0 [2024-11-19 23:44:05,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 23:44:05,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 23:44:05,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 23:44:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2101905688, now seen corresponding path program 1 times [2024-11-19 23:44:05,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 23:44:05,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989017143] [2024-11-19 23:44:05,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 23:44:05,761 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-19 23:44:05,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 23:44:05,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 23:44:05,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process