./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound5.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 f7372e141bce7d93eac34ddc01970d0d3ee3e3dd05571cb5550acbf38c8c76e9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:01:02,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:01:02,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:01:02,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:01:02,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:01:02,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:01:02,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:01:02,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:01:02,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:01:02,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:01:02,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:01:02,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:01:02,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:01:02,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:01:02,681 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:01:02,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:01:02,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:01:02,683 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:01:02,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:01:02,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:01:02,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:01:02,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:01:02,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:01:02,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:01:02,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:01:02,686 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:01:02,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:01:02,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:01:02,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:01:02,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:01:02,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:01:02,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:01:02,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:01:02,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:01:02,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:01:02,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:01:02,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:01:02,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:01:02,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:01:02,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:01:02,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:01:02,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:01:02,693 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 -> f7372e141bce7d93eac34ddc01970d0d3ee3e3dd05571cb5550acbf38c8c76e9 [2024-11-11 20:01:02,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:01:02,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:01:02,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:01:02,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:01:02,935 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:01:02,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound5.i [2024-11-11 20:01:04,345 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:01:04,528 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:01:04,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound5.i [2024-11-11 20:01:04,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541adcdd7/04650ea74e114ad8a287691ab56a5c79/FLAG9105524e7 [2024-11-11 20:01:04,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541adcdd7/04650ea74e114ad8a287691ab56a5c79 [2024-11-11 20:01:04,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:01:04,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:01:04,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:01:04,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:01:04,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:01:04,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d0f4572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04, skipping insertion in model container [2024-11-11 20:01:04,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:01:04,755 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/nla-digbench-scaling/divbin2_valuebound5.i[951,964] [2024-11-11 20:01:04,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:01:04,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:01:04,799 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/nla-digbench-scaling/divbin2_valuebound5.i[951,964] [2024-11-11 20:01:04,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:01:04,822 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:01:04,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04 WrapperNode [2024-11-11 20:01:04,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:01:04,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:01:04,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:01:04,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:01:04,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,854 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2024-11-11 20:01:04,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:01:04,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:01:04,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:01:04,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:01:04,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,881 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:01:04,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:01:04,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:01:04,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:01:04,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:01:04,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (1/1) ... [2024-11-11 20:01:04,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:01:04,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:01:04,927 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-11 20:01:04,929 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-11 20:01:04,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:01:04,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:01:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:01:04,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:01:04,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 20:01:04,966 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 20:01:05,019 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:01:05,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:01:05,125 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-11 20:01:05,125 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:01:05,136 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:01:05,136 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:01:05,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:01:05 BoogieIcfgContainer [2024-11-11 20:01:05,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:01:05,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:01:05,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:01:05,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:01:05,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:01:04" (1/3) ... [2024-11-11 20:01:05,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a1ac4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:01:05, skipping insertion in model container [2024-11-11 20:01:05,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:01:04" (2/3) ... [2024-11-11 20:01:05,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a1ac4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:01:05, skipping insertion in model container [2024-11-11 20:01:05,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:01:05" (3/3) ... [2024-11-11 20:01:05,145 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound5.i [2024-11-11 20:01:05,158 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:01:05,158 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:01:05,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:01:05,254 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;@216f13ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:01:05,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:01:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:01:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 20:01:05,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:01:05,273 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:01:05,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:01:05,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:01:05,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1105477780, now seen corresponding path program 1 times [2024-11-11 20:01:05,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:01:05,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466606361] [2024-11-11 20:01:05,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:01:05,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:01:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:01:05,442 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-11 20:01:05,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:01:05,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466606361] [2024-11-11 20:01:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466606361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:01:05,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:01:05,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:01:05,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875140267] [2024-11-11 20:01:05,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:01:05,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:01:05,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:01:05,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:01:05,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:01:05,479 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11 20:01:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:01:05,493 INFO L93 Difference]: Finished difference Result 39 states and 58 transitions. [2024-11-11 20:01:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:01:05,494 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2024-11-11 20:01:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:01:05,499 INFO L225 Difference]: With dead ends: 39 [2024-11-11 20:01:05,499 INFO L226 Difference]: Without dead ends: 17 [2024-11-11 20:01:05,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:01:05,504 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:01:05,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:01:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-11 20:01:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-11 20:01:05,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:01:05,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-11-11 20:01:05,531 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2024-11-11 20:01:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:01:05,531 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-11-11 20:01:05,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-11 20:01:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-11 20:01:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 20:01:05,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:01:05,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:01:05,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:01:05,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:01:05,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:01:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2095969935, now seen corresponding path program 1 times [2024-11-11 20:01:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:01:05,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025172951] [2024-11-11 20:01:05,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:01:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:01:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:01:05,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102987361] [2024-11-11 20:01:05,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:01:05,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:01:05,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:01:05,585 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-11 20:01:05,586 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-11 20:01:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:01:05,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 20:01:05,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:01:05,775 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-11 20:01:05,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:01:05,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:01:05,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025172951] [2024-11-11 20:01:05,777 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:01:05,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102987361] [2024-11-11 20:01:05,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102987361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:01:05,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:01:05,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 20:01:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364895899] [2024-11-11 20:01:05,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:01:05,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:01:05,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:01:05,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:01:05,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:01:05,780 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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-11 20:01:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:01:05,844 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-11 20:01:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:01:05,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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-11 20:01:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:01:05,846 INFO L225 Difference]: With dead ends: 28 [2024-11-11 20:01:05,847 INFO L226 Difference]: Without dead ends: 25 [2024-11-11 20:01:05,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:01:05,849 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:01:05,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:01:05,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-11 20:01:05,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-11 20:01:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:01:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-11 20:01:05,860 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2024-11-11 20:01:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:01:05,860 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-11 20:01:05,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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-11 20:01:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-11 20:01:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-11 20:01:05,861 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:01:05,861 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:01:05,877 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-11 20:01:06,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:01:06,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:01:06,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:01:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1791376988, now seen corresponding path program 1 times [2024-11-11 20:01:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:01:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427311444] [2024-11-11 20:01:06,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:01:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:01:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:01:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:01:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:01:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:01:06,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:01:06,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427311444] [2024-11-11 20:01:06,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427311444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:01:06,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:01:06,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:01:06,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286521423] [2024-11-11 20:01:06,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:01:06,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:01:06,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:01:06,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:01:06,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:01:06,434 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:01:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:01:06,457 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-11 20:01:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:01:06,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-11 20:01:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:01:06,458 INFO L225 Difference]: With dead ends: 49 [2024-11-11 20:01:06,459 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 20:01:06,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11 20:01:06,462 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:01:06,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:01:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 20:01:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-11 20:01:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:01:06,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-11 20:01:06,471 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2024-11-11 20:01:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:01:06,472 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-11 20:01:06,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 20:01:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-11 20:01:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 20:01:06,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:01:06,475 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:01:06,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:01:06,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:01:06,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:01:06,477 INFO L85 PathProgramCache]: Analyzing trace with hash -800204289, now seen corresponding path program 1 times [2024-11-11 20:01:06,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:01:06,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857536723] [2024-11-11 20:01:06,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:01:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:01:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-11 20:01:06,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1534744599] [2024-11-11 20:01:06,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:01:06,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:01:06,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:01:06,529 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-11 20:01:06,530 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-11 20:01:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:01:06,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-11 20:01:06,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:01:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:01:07,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:01:35,614 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 20:01:51,653 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 20:01:55,673 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse2 (mod |c_ULTIMATE.start_main_~b~0#1| 2147483648)) (.cse1 (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296))) (or (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|) 4294967296) .cse0)) (< .cse1 (mod |c_ULTIMATE.start_main_~b~0#1| 4294967296)) (= (mod (+ |c_ULTIMATE.start_main_~r~0#1| (* 2 .cse2 |c_ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse0) (< (* 2 .cse2) (+ .cse1 1)))) is different from true [2024-11-11 20:02:05,404 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 20:02:21,426 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 20:02:37,452 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-11 20:02:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-11 20:02:37,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:02:37,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857536723] [2024-11-11 20:02:37,461 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-11 20:02:37,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534744599] [2024-11-11 20:02:37,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534744599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:02:37,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 20:02:37,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2024-11-11 20:02:37,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675715259] [2024-11-11 20:02:37,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 20:02:37,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 20:02:37,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:02:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 20:02:37,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=243, Unknown=1, NotChecked=32, Total=342 [2024-11-11 20:02:37,468 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 17 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-11 20:02:42,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-11 20:02:46,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []