./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/verifythis/duplets.c -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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 18:44:44,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:44:44,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 18:44:44,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:44:44,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:44:44,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:44:44,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:44:44,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:44:44,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:44:44,898 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:44:44,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:44:44,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:44:44,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:44:44,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:44:44,901 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:44:44,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:44:44,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:44:44,902 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:44:44,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 18:44:44,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:44:44,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:44:44,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:44:44,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:44:44,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:44:44,904 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:44:44,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:44:44,904 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:44:44,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:44:44,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:44:44,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:44:44,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:44:44,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:44:44,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:44:44,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:44:44,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:44:44,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 18:44:44,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 18:44:44,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:44:44,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:44:44,907 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:44:44,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:44:44,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:44:44,908 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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2023-11-22 18:44:45,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:44:45,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:44:45,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:44:45,158 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:44:45,159 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:44:45,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/duplets.c [2023-11-22 18:44:46,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:44:46,535 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:44:46,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c [2023-11-22 18:44:46,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e465a9eb/9e05baa9f791481fbefeb58761e4a1ee/FLAG4468e8362 [2023-11-22 18:44:46,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e465a9eb/9e05baa9f791481fbefeb58761e4a1ee [2023-11-22 18:44:46,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:44:46,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:44:46,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:44:46,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:44:46,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:44:46,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca6960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46, skipping insertion in model container [2023-11-22 18:44:46,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,593 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:44:46,700 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2023-11-22 18:44:46,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:44:46,729 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:44:46,739 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2023-11-22 18:44:46,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:44:46,765 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:44:46,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46 WrapperNode [2023-11-22 18:44:46,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:44:46,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:44:46,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:44:46,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:44:46,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,798 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-11-22 18:44:46,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:44:46,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:44:46,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:44:46,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:44:46,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,819 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,839 INFO L189 HeapSplitter]: Split 18 memory accesses to 4 slices as follows [2, 5, 6, 5] [2023-11-22 18:44:46,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:44:46,863 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:44:46,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:44:46,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:44:46,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (1/1) ... [2023-11-22 18:44:46,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:44:46,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:44:46,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 18:44:46,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 18:44:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:44:46,969 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-22 18:44:46,969 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-22 18:44:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 18:44:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-22 18:44:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-22 18:44:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-22 18:44:46,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 18:44:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-22 18:44:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-22 18:44:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-22 18:44:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-22 18:44:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 18:44:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:44:46,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:44:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-22 18:44:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-22 18:44:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-22 18:44:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-22 18:44:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-22 18:44:46,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-22 18:44:46,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 18:44:47,086 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:44:47,088 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:44:47,328 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:44:47,360 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:44:47,364 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 18:44:47,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:44:47 BoogieIcfgContainer [2023-11-22 18:44:47,365 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:44:47,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:44:47,367 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:44:47,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:44:47,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:44:46" (1/3) ... [2023-11-22 18:44:47,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29432f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:44:47, skipping insertion in model container [2023-11-22 18:44:47,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:44:46" (2/3) ... [2023-11-22 18:44:47,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29432f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:44:47, skipping insertion in model container [2023-11-22 18:44:47,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:44:47" (3/3) ... [2023-11-22 18:44:47,374 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2023-11-22 18:44:47,388 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:44:47,389 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:44:47,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:44:47,428 INFO L357 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, mHoare=true, 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;@53eef61f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:44:47,428 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:44:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 18:44:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 18:44:47,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:47,438 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:47,438 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:47,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:47,442 INFO L85 PathProgramCache]: Analyzing trace with hash -633346845, now seen corresponding path program 1 times [2023-11-22 18:44:47,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:47,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528670375] [2023-11-22 18:44:47,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:47,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:47,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:47,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:47,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:44:47,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:47,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528670375] [2023-11-22 18:44:47,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528670375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:44:47,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:44:47,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:44:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674428547] [2023-11-22 18:44:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:44:47,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 18:44:47,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:47,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 18:44:47,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:44:47,685 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 18:44:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:44:47,737 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2023-11-22 18:44:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 18:44:47,740 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2023-11-22 18:44:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:44:47,747 INFO L225 Difference]: With dead ends: 70 [2023-11-22 18:44:47,747 INFO L226 Difference]: Without dead ends: 34 [2023-11-22 18:44:47,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:44:47,755 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:44:47,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:44:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-22 18:44:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-22 18:44:47,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 18:44:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-11-22 18:44:47,789 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 30 [2023-11-22 18:44:47,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:44:47,789 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-22 18:44:47,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 18:44:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2023-11-22 18:44:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 18:44:47,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:47,791 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:47,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 18:44:47,792 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:47,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:47,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1840136240, now seen corresponding path program 1 times [2023-11-22 18:44:47,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:47,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506681541] [2023-11-22 18:44:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:47,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:48,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:48,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:48,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:44:48,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:48,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506681541] [2023-11-22 18:44:48,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506681541] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:44:48,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497722623] [2023-11-22 18:44:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:48,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:44:48,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:44:48,202 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) [2023-11-22 18:44:48,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 18:44:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:48,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 18:44:48,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:44:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:44:48,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:44:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:44:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497722623] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:44:48,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:44:48,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-22 18:44:48,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246232029] [2023-11-22 18:44:48,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:44:48,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 18:44:48,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:48,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 18:44:48,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-22 18:44:48,498 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-22 18:44:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:44:48,620 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2023-11-22 18:44:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 18:44:48,620 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-22 18:44:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:44:48,622 INFO L225 Difference]: With dead ends: 59 [2023-11-22 18:44:48,622 INFO L226 Difference]: Without dead ends: 40 [2023-11-22 18:44:48,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-11-22 18:44:48,624 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:44:48,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 193 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:44:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-22 18:44:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2023-11-22 18:44:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 18:44:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-22 18:44:48,632 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 30 [2023-11-22 18:44:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:44:48,633 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-22 18:44:48,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-22 18:44:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-22 18:44:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 18:44:48,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:48,635 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:48,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 18:44:48,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:44:48,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:48,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1407409120, now seen corresponding path program 1 times [2023-11-22 18:44:48,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:48,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653159215] [2023-11-22 18:44:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:48,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:44:49,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:49,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653159215] [2023-11-22 18:44:49,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653159215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:44:49,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:44:49,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 18:44:49,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377880384] [2023-11-22 18:44:49,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:44:49,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 18:44:49,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:49,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 18:44:49,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:44:49,013 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-22 18:44:49,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:44:49,087 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2023-11-22 18:44:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 18:44:49,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-11-22 18:44:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:44:49,088 INFO L225 Difference]: With dead ends: 53 [2023-11-22 18:44:49,088 INFO L226 Difference]: Without dead ends: 51 [2023-11-22 18:44:49,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 18:44:49,090 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:44:49,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 200 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:44:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-22 18:44:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2023-11-22 18:44:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 18:44:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2023-11-22 18:44:49,098 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 31 [2023-11-22 18:44:49,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:44:49,099 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-22 18:44:49,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-22 18:44:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2023-11-22 18:44:49,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-22 18:44:49,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:49,100 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:49,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 18:44:49,101 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:49,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash 449686045, now seen corresponding path program 1 times [2023-11-22 18:44:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:49,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144749602] [2023-11-22 18:44:49,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:49,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:44:49,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:49,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144749602] [2023-11-22 18:44:49,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144749602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:44:49,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:44:49,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-22 18:44:49,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289895722] [2023-11-22 18:44:49,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:44:49,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 18:44:49,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:49,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 18:44:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-22 18:44:49,613 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 18:44:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:44:49,837 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2023-11-22 18:44:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 18:44:49,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2023-11-22 18:44:49,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:44:49,842 INFO L225 Difference]: With dead ends: 75 [2023-11-22 18:44:49,843 INFO L226 Difference]: Without dead ends: 46 [2023-11-22 18:44:49,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-22 18:44:49,845 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:44:49,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 226 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:44:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-22 18:44:49,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2023-11-22 18:44:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 18:44:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2023-11-22 18:44:49,859 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 33 [2023-11-22 18:44:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:44:49,860 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-11-22 18:44:49,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 18:44:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2023-11-22 18:44:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 18:44:49,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:49,861 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:49,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 18:44:49,862 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:49,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:49,862 INFO L85 PathProgramCache]: Analyzing trace with hash -320162031, now seen corresponding path program 1 times [2023-11-22 18:44:49,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:49,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088213793] [2023-11-22 18:44:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:49,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:49,952 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:44:49,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:49,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088213793] [2023-11-22 18:44:49,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088213793] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:44:49,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110618406] [2023-11-22 18:44:49,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:49,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:44:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:44:49,955 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) [2023-11-22 18:44:49,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 18:44:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:50,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 18:44:50,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:44:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:44:50,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:44:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:44:50,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110618406] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:44:50,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:44:50,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-22 18:44:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85883126] [2023-11-22 18:44:50,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:44:50,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 18:44:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:50,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 18:44:50,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:44:50,073 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-22 18:44:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:44:50,110 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2023-11-22 18:44:50,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 18:44:50,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2023-11-22 18:44:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:44:50,111 INFO L225 Difference]: With dead ends: 64 [2023-11-22 18:44:50,111 INFO L226 Difference]: Without dead ends: 45 [2023-11-22 18:44:50,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:44:50,112 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:44:50,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:44:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-22 18:44:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-22 18:44:50,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 18:44:50,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2023-11-22 18:44:50,120 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 35 [2023-11-22 18:44:50,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:44:50,120 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2023-11-22 18:44:50,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-22 18:44:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2023-11-22 18:44:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 18:44:50,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:50,122 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:50,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 18:44:50,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:44:50,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:50,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:50,333 INFO L85 PathProgramCache]: Analyzing trace with hash 9167953, now seen corresponding path program 1 times [2023-11-22 18:44:50,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:50,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601281302] [2023-11-22 18:44:50,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:50,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:50,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:50,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:50,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:50,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-22 18:44:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:44:50,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:50,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601281302] [2023-11-22 18:44:50,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601281302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:44:50,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:44:50,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-22 18:44:50,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673399687] [2023-11-22 18:44:50,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:44:50,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 18:44:50,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:50,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 18:44:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-22 18:44:50,675 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-22 18:44:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:44:50,856 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2023-11-22 18:44:50,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 18:44:50,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-22 18:44:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:44:50,858 INFO L225 Difference]: With dead ends: 78 [2023-11-22 18:44:50,858 INFO L226 Difference]: Without dead ends: 64 [2023-11-22 18:44:50,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-11-22 18:44:50,859 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 22 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:44:50,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 244 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:44:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-22 18:44:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2023-11-22 18:44:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 42 states have internal predecessors, (48), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-22 18:44:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2023-11-22 18:44:50,870 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 38 [2023-11-22 18:44:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:44:50,870 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2023-11-22 18:44:50,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-22 18:44:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2023-11-22 18:44:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 18:44:50,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:50,872 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:50,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-22 18:44:50,872 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:50,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash 161144636, now seen corresponding path program 2 times [2023-11-22 18:44:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:50,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672767787] [2023-11-22 18:44:50,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:51,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:51,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-22 18:44:51,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672767787] [2023-11-22 18:44:51,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672767787] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:44:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852411236] [2023-11-22 18:44:51,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 18:44:51,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:44:51,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:44:51,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:44:51,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 18:44:51,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 18:44:51,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:44:51,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-22 18:44:51,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:44:51,891 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-22 18:44:51,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 19 [2023-11-22 18:44:52,080 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-22 18:44:52,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 46 [2023-11-22 18:44:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:44:52,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:44:52,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:44:52,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 503 treesize of output 435 [2023-11-22 18:44:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:44:54,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852411236] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:44:54,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:44:54,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 33 [2023-11-22 18:44:54,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598427262] [2023-11-22 18:44:54,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:44:54,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-22 18:44:54,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-22 18:44:54,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2023-11-22 18:44:54,834 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 33 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-22 18:44:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:44:55,552 INFO L93 Difference]: Finished difference Result 107 states and 140 transitions. [2023-11-22 18:44:55,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 18:44:55,553 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 38 [2023-11-22 18:44:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:44:55,554 INFO L225 Difference]: With dead ends: 107 [2023-11-22 18:44:55,554 INFO L226 Difference]: Without dead ends: 75 [2023-11-22 18:44:55,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=244, Invalid=1562, Unknown=0, NotChecked=0, Total=1806 [2023-11-22 18:44:55,556 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 53 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:44:55,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 543 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 18:44:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-22 18:44:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2023-11-22 18:44:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 states have internal predecessors, (53), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-22 18:44:55,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2023-11-22 18:44:55,575 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 38 [2023-11-22 18:44:55,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:44:55,576 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2023-11-22 18:44:55,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-22 18:44:55,576 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2023-11-22 18:44:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-22 18:44:55,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:55,579 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:55,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 18:44:55,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:44:55,792 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:55,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1824005157, now seen corresponding path program 3 times [2023-11-22 18:44:55,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:55,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256514147] [2023-11-22 18:44:55,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:55,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:55,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:55,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:55,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:55,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-22 18:44:55,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:55,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256514147] [2023-11-22 18:44:55,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256514147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:44:55,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:44:55,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 18:44:55,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606305595] [2023-11-22 18:44:55,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:44:55,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 18:44:55,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:55,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 18:44:55,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:44:55,849 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-22 18:44:55,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:44:55,890 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2023-11-22 18:44:55,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 18:44:55,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2023-11-22 18:44:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:44:55,892 INFO L225 Difference]: With dead ends: 98 [2023-11-22 18:44:55,892 INFO L226 Difference]: Without dead ends: 64 [2023-11-22 18:44:55,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:44:55,895 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:44:55,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 105 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:44:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-22 18:44:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2023-11-22 18:44:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 47 states have internal predecessors, (53), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-22 18:44:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2023-11-22 18:44:55,913 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 43 [2023-11-22 18:44:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:44:55,915 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2023-11-22 18:44:55,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-22 18:44:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2023-11-22 18:44:55,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 18:44:55,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:55,918 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:55,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 18:44:55,919 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:55,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:55,919 INFO L85 PathProgramCache]: Analyzing trace with hash 956566272, now seen corresponding path program 1 times [2023-11-22 18:44:55,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:55,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185478368] [2023-11-22 18:44:55,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:55,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-22 18:44:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 18:44:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,107 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 18:44:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185478368] [2023-11-22 18:44:56,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185478368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:44:56,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:44:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 18:44:56,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475126956] [2023-11-22 18:44:56,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:44:56,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 18:44:56,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 18:44:56,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-22 18:44:56,109 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 18:44:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:44:56,228 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2023-11-22 18:44:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 18:44:56,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-22 18:44:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:44:56,230 INFO L225 Difference]: With dead ends: 79 [2023-11-22 18:44:56,230 INFO L226 Difference]: Without dead ends: 77 [2023-11-22 18:44:56,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-22 18:44:56,231 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:44:56,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 200 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:44:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-22 18:44:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2023-11-22 18:44:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 54 states have internal predecessors, (62), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-22 18:44:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2023-11-22 18:44:56,242 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 45 [2023-11-22 18:44:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:44:56,242 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2023-11-22 18:44:56,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 18:44:56,243 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2023-11-22 18:44:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 18:44:56,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:56,243 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:56,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-22 18:44:56,244 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:56,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash 958413314, now seen corresponding path program 1 times [2023-11-22 18:44:56,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:56,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703441126] [2023-11-22 18:44:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:56,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-22 18:44:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 18:44:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 18:44:56,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:56,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703441126] [2023-11-22 18:44:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703441126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:44:56,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:44:56,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 18:44:56,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224422859] [2023-11-22 18:44:56,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:44:56,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 18:44:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:56,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 18:44:56,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:44:56,402 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 18:44:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:44:56,474 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2023-11-22 18:44:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 18:44:56,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-22 18:44:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:44:56,477 INFO L225 Difference]: With dead ends: 89 [2023-11-22 18:44:56,477 INFO L226 Difference]: Without dead ends: 78 [2023-11-22 18:44:56,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-22 18:44:56,478 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:44:56,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 143 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:44:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-22 18:44:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2023-11-22 18:44:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-22 18:44:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 91 transitions. [2023-11-22 18:44:56,490 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 91 transitions. Word has length 45 [2023-11-22 18:44:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:44:56,490 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 91 transitions. [2023-11-22 18:44:56,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 18:44:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 91 transitions. [2023-11-22 18:44:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 18:44:56,491 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:56,491 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:56,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 18:44:56,491 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:56,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:56,492 INFO L85 PathProgramCache]: Analyzing trace with hash 601257606, now seen corresponding path program 1 times [2023-11-22 18:44:56,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:56,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531678303] [2023-11-22 18:44:56,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:56,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 18:44:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-22 18:44:56,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:56,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531678303] [2023-11-22 18:44:56,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531678303] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:44:56,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801424470] [2023-11-22 18:44:56,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:56,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:44:56,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:44:56,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:44:56,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 18:44:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:56,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-22 18:44:56,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:44:56,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 18:44:56,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-22 18:44:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 18:44:56,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:44:56,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-22 18:44:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 18:44:57,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801424470] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:44:57,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:44:57,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 15 [2023-11-22 18:44:57,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970879093] [2023-11-22 18:44:57,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:44:57,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-22 18:44:57,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:57,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-22 18:44:57,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-11-22 18:44:57,078 INFO L87 Difference]: Start difference. First operand 73 states and 91 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-22 18:44:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:44:57,284 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2023-11-22 18:44:57,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 18:44:57,284 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2023-11-22 18:44:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:44:57,285 INFO L225 Difference]: With dead ends: 86 [2023-11-22 18:44:57,285 INFO L226 Difference]: Without dead ends: 84 [2023-11-22 18:44:57,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2023-11-22 18:44:57,286 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 27 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:44:57,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 298 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:44:57,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-22 18:44:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2023-11-22 18:44:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-22 18:44:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2023-11-22 18:44:57,294 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 45 [2023-11-22 18:44:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:44:57,295 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2023-11-22 18:44:57,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-22 18:44:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2023-11-22 18:44:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 18:44:57,296 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:44:57,296 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:44:57,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 18:44:57,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:44:57,509 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:44:57,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:44:57,509 INFO L85 PathProgramCache]: Analyzing trace with hash 603104648, now seen corresponding path program 1 times [2023-11-22 18:44:57,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:44:57,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503131919] [2023-11-22 18:44:57,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:57,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:44:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:44:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:57,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:44:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:57,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:44:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:57,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:44:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:57,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 18:44:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 18:44:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:44:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503131919] [2023-11-22 18:44:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503131919] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:44:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517879563] [2023-11-22 18:44:57,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:44:57,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:44:57,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:44:57,643 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:44:57,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 18:44:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:44:57,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-22 18:44:57,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:44:57,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 18:44:57,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 18:44:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 18:44:57,816 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:44:57,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517879563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:44:57,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:44:57,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 8 [2023-11-22 18:44:57,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103074046] [2023-11-22 18:44:57,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:44:57,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 18:44:57,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:44:57,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 18:44:57,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-22 18:44:57,820 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-22 18:44:59,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:45:01,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:45:03,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:45:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:03,970 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2023-11-22 18:45:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 18:45:03,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2023-11-22 18:45:03,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:03,971 INFO L225 Difference]: With dead ends: 116 [2023-11-22 18:45:03,971 INFO L226 Difference]: Without dead ends: 97 [2023-11-22 18:45:03,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-22 18:45:03,972 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 17 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:03,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 210 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2023-11-22 18:45:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-22 18:45:03,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2023-11-22 18:45:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.164179104477612) internal successors, (78), 71 states have internal predecessors, (78), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-22 18:45:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2023-11-22 18:45:03,985 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 45 [2023-11-22 18:45:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:03,986 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2023-11-22 18:45:03,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-22 18:45:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2023-11-22 18:45:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 18:45:03,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:03,987 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:04,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-22 18:45:04,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-22 18:45:04,204 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:04,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:04,205 INFO L85 PathProgramCache]: Analyzing trace with hash 753234289, now seen corresponding path program 4 times [2023-11-22 18:45:04,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:04,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23642317] [2023-11-22 18:45:04,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:04,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:06,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:45:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:45:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:06,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:45:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:06,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:45:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-22 18:45:06,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:45:06,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23642317] [2023-11-22 18:45:06,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23642317] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:45:06,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407651049] [2023-11-22 18:45:06,306 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-22 18:45:06,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:45:06,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:45:06,307 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:45:06,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-22 18:45:06,430 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-22 18:45:06,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:45:06,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-22 18:45:06,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:06,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-22 18:45:06,767 INFO L349 Elim1Store]: treesize reduction 88, result has 28.5 percent of original size [2023-11-22 18:45:06,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 78 [2023-11-22 18:45:06,791 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-22 18:45:06,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2023-11-22 18:45:09,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:45:09,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 122 [2023-11-22 18:45:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-22 18:45:09,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:45:10,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407651049] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:45:10,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:45:10,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 26 [2023-11-22 18:45:10,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975835386] [2023-11-22 18:45:10,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:45:10,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-22 18:45:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:45:10,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-22 18:45:10,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2023-11-22 18:45:10,504 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-22 18:45:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:13,125 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2023-11-22 18:45:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-22 18:45:13,126 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2023-11-22 18:45:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:13,127 INFO L225 Difference]: With dead ends: 146 [2023-11-22 18:45:13,127 INFO L226 Difference]: Without dead ends: 91 [2023-11-22 18:45:13,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=219, Invalid=1341, Unknown=0, NotChecked=0, Total=1560 [2023-11-22 18:45:13,129 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 31 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:13,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 507 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-22 18:45:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-22 18:45:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2023-11-22 18:45:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.103448275862069) internal successors, (64), 61 states have internal predecessors, (64), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-22 18:45:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2023-11-22 18:45:13,160 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 45 [2023-11-22 18:45:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:13,160 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2023-11-22 18:45:13,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 5 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-22 18:45:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2023-11-22 18:45:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-22 18:45:13,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:13,161 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:13,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-22 18:45:13,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:45:13,375 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:13,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1531281429, now seen corresponding path program 1 times [2023-11-22 18:45:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:13,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206859278] [2023-11-22 18:45:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:45:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:45:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:45:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:45:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-22 18:45:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 18:45:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 18:45:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-22 18:45:13,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:45:13,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206859278] [2023-11-22 18:45:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206859278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:13,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:13,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 18:45:13,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536323967] [2023-11-22 18:45:13,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:13,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 18:45:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:45:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 18:45:13,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 18:45:13,636 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-22 18:45:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:13,782 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2023-11-22 18:45:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 18:45:13,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 51 [2023-11-22 18:45:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:13,783 INFO L225 Difference]: With dead ends: 90 [2023-11-22 18:45:13,783 INFO L226 Difference]: Without dead ends: 86 [2023-11-22 18:45:13,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-22 18:45:13,784 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:13,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 189 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:45:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-22 18:45:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-22 18:45:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 62 states have internal predecessors, (65), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-22 18:45:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2023-11-22 18:45:13,797 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 51 [2023-11-22 18:45:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:13,797 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2023-11-22 18:45:13,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-22 18:45:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2023-11-22 18:45:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-22 18:45:13,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:13,798 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:13,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-22 18:45:13,798 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:13,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:13,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1681149395, now seen corresponding path program 1 times [2023-11-22 18:45:13,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:13,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540990041] [2023-11-22 18:45:13,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:13,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:45:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:45:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:45:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:45:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 18:45:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 18:45:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-22 18:45:13,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:45:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540990041] [2023-11-22 18:45:13,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540990041] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:45:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239162259] [2023-11-22 18:45:13,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:13,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:45:13,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:45:13,956 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:45:13,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-22 18:45:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:14,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-22 18:45:14,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:14,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 18:45:14,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-22 18:45:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-22 18:45:14,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:45:14,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2023-11-22 18:45:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-22 18:45:14,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239162259] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:45:14,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:45:14,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2023-11-22 18:45:14,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682444798] [2023-11-22 18:45:14,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:45:14,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 18:45:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:45:14,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 18:45:14,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-22 18:45:14,346 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 18:45:16,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:45:18,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:45:20,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:45:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:20,568 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-11-22 18:45:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 18:45:20,568 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 52 [2023-11-22 18:45:20,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:20,569 INFO L225 Difference]: With dead ends: 98 [2023-11-22 18:45:20,569 INFO L226 Difference]: Without dead ends: 87 [2023-11-22 18:45:20,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2023-11-22 18:45:20,570 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:20,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 302 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2023-11-22 18:45:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-22 18:45:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2023-11-22 18:45:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 61 states have internal predecessors, (64), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-22 18:45:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2023-11-22 18:45:20,581 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 52 [2023-11-22 18:45:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:20,581 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2023-11-22 18:45:20,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 18:45:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2023-11-22 18:45:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-22 18:45:20,581 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:20,581 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:20,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-22 18:45:20,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:45:20,782 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:20,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:20,783 INFO L85 PathProgramCache]: Analyzing trace with hash -710336108, now seen corresponding path program 1 times [2023-11-22 18:45:20,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:20,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551683477] [2023-11-22 18:45:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:20,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:45:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:45:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:45:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:45:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-22 18:45:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 18:45:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 18:45:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 18:45:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-22 18:45:21,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:45:21,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551683477] [2023-11-22 18:45:21,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551683477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:21,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:21,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 18:45:21,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678931475] [2023-11-22 18:45:21,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:21,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 18:45:21,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:45:21,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 18:45:21,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-22 18:45:21,239 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-22 18:45:21,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:21,451 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2023-11-22 18:45:21,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 18:45:21,452 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 57 [2023-11-22 18:45:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:21,453 INFO L225 Difference]: With dead ends: 87 [2023-11-22 18:45:21,453 INFO L226 Difference]: Without dead ends: 55 [2023-11-22 18:45:21,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-22 18:45:21,453 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:21,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 131 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:45:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-22 18:45:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-22 18:45:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 18:45:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2023-11-22 18:45:21,463 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 57 [2023-11-22 18:45:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:21,463 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2023-11-22 18:45:21,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-22 18:45:21,464 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2023-11-22 18:45:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-22 18:45:21,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:21,464 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:21,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-22 18:45:21,465 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:21,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:21,465 INFO L85 PathProgramCache]: Analyzing trace with hash -375919658, now seen corresponding path program 1 times [2023-11-22 18:45:21,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:21,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753730901] [2023-11-22 18:45:21,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:21,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:45:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:45:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:45:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:45:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 18:45:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 18:45:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 18:45:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-22 18:45:21,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:45:21,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753730901] [2023-11-22 18:45:21,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753730901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:21,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:21,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 18:45:21,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084258352] [2023-11-22 18:45:21,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:21,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 18:45:21,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:45:21,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 18:45:21,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 18:45:21,731 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-22 18:45:21,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:21,844 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2023-11-22 18:45:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 18:45:21,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2023-11-22 18:45:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:21,845 INFO L225 Difference]: With dead ends: 61 [2023-11-22 18:45:21,846 INFO L226 Difference]: Without dead ends: 57 [2023-11-22 18:45:21,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-22 18:45:21,846 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:21,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 154 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:45:21,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-22 18:45:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-22 18:45:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 18:45:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2023-11-22 18:45:21,857 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 58 [2023-11-22 18:45:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:21,858 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2023-11-22 18:45:21,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-22 18:45:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2023-11-22 18:45:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-22 18:45:21,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:21,862 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:21,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-22 18:45:21,862 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:21,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:21,863 INFO L85 PathProgramCache]: Analyzing trace with hash 182628671, now seen corresponding path program 1 times [2023-11-22 18:45:21,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:21,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624575666] [2023-11-22 18:45:21,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:21,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 18:45:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:22,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:45:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:22,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 18:45:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:22,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 18:45:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 18:45:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-22 18:45:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 18:45:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:22,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 18:45:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-22 18:45:22,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:45:22,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624575666] [2023-11-22 18:45:22,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624575666] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:45:22,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967423293] [2023-11-22 18:45:22,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:22,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:45:22,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:45:22,328 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:45:22,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-22 18:45:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:22,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-22 18:45:22,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:22,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-22 18:45:22,757 INFO L349 Elim1Store]: treesize reduction 49, result has 15.5 percent of original size [2023-11-22 18:45:22,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 53 [2023-11-22 18:45:23,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:45:23,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:45:25,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2023-11-22 18:45:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-22 18:45:25,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:45:25,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2023-11-22 18:45:25,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 [2023-11-22 18:45:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-11-22 18:45:28,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967423293] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:45:28,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:45:28,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 14] total 37 [2023-11-22 18:45:28,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148376791] [2023-11-22 18:45:28,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:45:28,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-22 18:45:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:45:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-22 18:45:28,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2023-11-22 18:45:28,403 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 37 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 31 states have internal predecessors, (72), 9 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-11-22 18:45:31,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:45:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:33,256 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2023-11-22 18:45:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-22 18:45:33,256 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 31 states have internal predecessors, (72), 9 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) Word has length 64 [2023-11-22 18:45:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:33,257 INFO L225 Difference]: With dead ends: 94 [2023-11-22 18:45:33,257 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 18:45:33,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 104 SyntacticMatches, 12 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=566, Invalid=3466, Unknown=0, NotChecked=0, Total=4032 [2023-11-22 18:45:33,259 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:33,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 238 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 645 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2023-11-22 18:45:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 18:45:33,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 18:45:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:45:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 18:45:33,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 64 [2023-11-22 18:45:33,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:33,260 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 18:45:33,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 31 states have internal predecessors, (72), 9 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2023-11-22 18:45:33,261 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 18:45:33,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 18:45:33,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 18:45:33,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-22 18:45:33,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-22 18:45:33,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-22 18:45:37,234 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2023-11-22 18:45:37,234 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2023-11-22 18:45:37,234 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 17) the Hoare annotation is: true [2023-11-22 18:45:37,234 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2023-11-22 18:45:37,234 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2023-11-22 18:45:37,234 INFO L895 garLoopResultBuilder]: At program point L60-2(line 60) the Hoare annotation is: (let ((.cse1 (select |#memory_int#2| |ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (select (select |#memory_int#1| |ULTIMATE.start_main_~#j~2#1.base|) |ULTIMATE.start_main_~#j~2#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse2 (select (select |#memory_int#3| |ULTIMATE.start_main_~#i~2#1.base|) |ULTIMATE.start_main_~#i~2#1.offset|)) (.cse4 (<= (+ .cse5 1) |ULTIMATE.start_main_~n~0#1|)) (.cse3 (select .cse1 (* .cse5 4)))) (or (and .cse0 |ULTIMATE.start_main_#t~short17#1| (= (select .cse1 (* 4 .cse2)) .cse3) .cse4 (<= (+ 1 .cse2) .cse5) (<= 1 .cse2)) (and (<= 1 .cse5) .cse0 |ULTIMATE.start_main_#t~short17#1| (= 0 .cse2) .cse4 (= .cse3 (select .cse1 0)))))) [2023-11-22 18:45:37,234 INFO L899 garLoopResultBuilder]: For program point L60-3(line 60) no Hoare annotation was computed. [2023-11-22 18:45:37,234 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_~a#1.base|) (= ((as const (Array Int Int)) 0) (select |#memory_int#2| |ULTIMATE.start_main_~a~0#1.base|)) (<= |ULTIMATE.start_mkdup_~n#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_mkdup_~a#1.offset| 0)) [2023-11-22 18:45:37,234 INFO L895 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= 0 |ULTIMATE.start_mkdup_~i~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_~a#1.base|) (= ((as const (Array Int Int)) 0) (select |#memory_int#2| |ULTIMATE.start_main_~a~0#1.base|)) (<= |ULTIMATE.start_mkdup_~n#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_mkdup_~a#1.offset| 0) (<= (+ |ULTIMATE.start_mkdup_~i~0#1| 1) |ULTIMATE.start_mkdup_~n#1|)) [2023-11-22 18:45:37,235 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 44) no Hoare annotation was computed. [2023-11-22 18:45:37,235 INFO L895 garLoopResultBuilder]: At program point L36-3(lines 36 44) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse3 (<= |ULTIMATE.start_finddup_~n#1| |ULTIMATE.start_main_~n~0#1|)) (.cse4 ((as const (Array Int Int)) 0)) (.cse7 (= |ULTIMATE.start_main_~#j~2#1.offset| |ULTIMATE.start_finddup_~_j#1.offset|)) (.cse8 (= |ULTIMATE.start_main_~#i~2#1.offset| |ULTIMATE.start_finddup_~_i#1.offset|)) (.cse9 (= |ULTIMATE.start_main_~#i~2#1.base| |ULTIMATE.start_finddup_~_i#1.base|)) (.cse10 (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_finddup_~a#1.base|)) (.cse11 (= |ULTIMATE.start_finddup_~a#1.offset| 0)) (.cse12 (= |ULTIMATE.start_main_~#j~2#1.base| |ULTIMATE.start_finddup_~_j#1.base|))) (or (let ((.cse2 (select |#memory_int#2| |ULTIMATE.start_finddup_~a#1.base|))) (let ((.cse1 (select .cse2 0))) (and .cse0 (not (= .cse1 (select .cse2 8))) .cse3 (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_24| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_22| Int)) (and (<= |v_ULTIMATE.start_mkdup_~i~0#1_22| 2) (= .cse2 (let ((.cse6 (* |v_ULTIMATE.start_mkdup_~j~0#1_24| 4))) (let ((.cse5 (select .cse2 .cse6))) (store (store .cse4 (* |v_ULTIMATE.start_mkdup_~i~0#1_22| 4) .cse5) .cse6 .cse5)))) (<= 0 |v_ULTIMATE.start_mkdup_~i~0#1_22|))) .cse7 .cse8 .cse9 (<= 3 |ULTIMATE.start_finddup_~n#1|) (<= 0 |ULTIMATE.start_finddup_~j~1#1|) (= |ULTIMATE.start_finddup_~i~1#1| 1) .cse10 (not (= .cse1 (select .cse2 4))) .cse11 .cse12))) (and .cse0 .cse3 (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_25| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_23| Int)) (and (<= (+ |v_ULTIMATE.start_mkdup_~j~0#1_25| 1) |ULTIMATE.start_finddup_~n#1|) (<= 0 |v_ULTIMATE.start_mkdup_~i~0#1_23|) (<= (+ |v_ULTIMATE.start_mkdup_~i~0#1_23| 1) |ULTIMATE.start_finddup_~n#1|) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_25|) (not (= |v_ULTIMATE.start_mkdup_~i~0#1_23| |v_ULTIMATE.start_mkdup_~j~0#1_25|)) (let ((.cse13 (select |#memory_int#2| |ULTIMATE.start_main_~a~0#1.base|))) (= .cse13 (let ((.cse15 (* |v_ULTIMATE.start_mkdup_~j~0#1_25| 4))) (let ((.cse14 (select .cse13 .cse15))) (store (store .cse4 (* |v_ULTIMATE.start_mkdup_~i~0#1_23| 4) .cse14) .cse15 .cse14))))))) .cse7 .cse8 .cse9 (= |ULTIMATE.start_finddup_~i~1#1| 0) .cse10 .cse11 .cse12))) [2023-11-22 18:45:37,235 INFO L899 garLoopResultBuilder]: For program point L36-4(lines 36 44) no Hoare annotation was computed. [2023-11-22 18:45:37,235 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-11-22 18:45:37,235 INFO L895 garLoopResultBuilder]: At program point L61-2(line 61) the Hoare annotation is: (let ((.cse1 (select |#memory_int#2| |ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (select (select |#memory_int#1| |ULTIMATE.start_main_~#j~2#1.base|) |ULTIMATE.start_main_~#j~2#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse2 (select (select |#memory_int#3| |ULTIMATE.start_main_~#i~2#1.base|) |ULTIMATE.start_main_~#i~2#1.offset|)) (.cse4 (<= (+ .cse5 1) |ULTIMATE.start_main_~n~0#1|)) (.cse3 (select .cse1 (* .cse5 4)))) (or (and .cse0 |ULTIMATE.start_main_#t~short20#1| (= (select .cse1 (* 4 .cse2)) .cse3) .cse4 (<= (+ 1 .cse2) .cse5) (<= 1 .cse2)) (and (<= 1 .cse5) .cse0 |ULTIMATE.start_main_#t~short20#1| (= 0 .cse2) .cse4 (= .cse3 (select .cse1 0)))))) [2023-11-22 18:45:37,235 INFO L899 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2023-11-22 18:45:37,235 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ |ULTIMATE.start_mkdup_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|) (<= 0 |ULTIMATE.start_mkdup_~i~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_~a#1.base|) (<= 0 |ULTIMATE.start_mkdup_~j~0#1|) (= ((as const (Array Int Int)) 0) (select |#memory_int#2| |ULTIMATE.start_main_~a~0#1.base|)) (<= |ULTIMATE.start_mkdup_~n#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_mkdup_~a#1.offset| 0) (<= (+ |ULTIMATE.start_mkdup_~i~0#1| 1) |ULTIMATE.start_mkdup_~n#1|)) [2023-11-22 18:45:37,236 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 43) the Hoare annotation is: (let ((.cse13 (select |#memory_int#2| |ULTIMATE.start_finddup_~a#1.base|))) (let ((.cse14 ((as const (Array Int Int)) 0)) (.cse17 (select .cse13 0))) (let ((.cse10 (= |ULTIMATE.start_finddup_~j~1#1| 2)) (.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse12 (not (= .cse17 (select .cse13 8)))) (.cse1 (<= |ULTIMATE.start_finddup_~n#1| |ULTIMATE.start_main_~n~0#1|)) (.cse2 (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_25| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_23| Int)) (and (<= (+ |v_ULTIMATE.start_mkdup_~j~0#1_25| 1) |ULTIMATE.start_finddup_~n#1|) (<= 0 |v_ULTIMATE.start_mkdup_~i~0#1_23|) (<= (+ |v_ULTIMATE.start_mkdup_~i~0#1_23| 1) |ULTIMATE.start_finddup_~n#1|) (<= 0 |v_ULTIMATE.start_mkdup_~j~0#1_25|) (not (= |v_ULTIMATE.start_mkdup_~i~0#1_23| |v_ULTIMATE.start_mkdup_~j~0#1_25|)) (let ((.cse18 (select |#memory_int#2| |ULTIMATE.start_main_~a~0#1.base|))) (= .cse18 (let ((.cse20 (* |v_ULTIMATE.start_mkdup_~j~0#1_25| 4))) (let ((.cse19 (select .cse18 .cse20))) (store (store .cse14 (* |v_ULTIMATE.start_mkdup_~i~0#1_23| 4) .cse19) .cse20 .cse19)))))))) (.cse3 (= |ULTIMATE.start_main_~#j~2#1.offset| |ULTIMATE.start_finddup_~_j#1.offset|)) (.cse4 (= |ULTIMATE.start_main_~#i~2#1.offset| |ULTIMATE.start_finddup_~_i#1.offset|)) (.cse5 (= |ULTIMATE.start_main_~#i~2#1.base| |ULTIMATE.start_finddup_~_i#1.base|)) (.cse6 (= |ULTIMATE.start_finddup_~i~1#1| 0)) (.cse7 (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_finddup_~a#1.base|)) (.cse11 (not (= .cse17 (select .cse13 4)))) (.cse8 (= |ULTIMATE.start_finddup_~a#1.offset| 0)) (.cse9 (= |ULTIMATE.start_main_~#j~2#1.base| |ULTIMATE.start_finddup_~_j#1.base|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_finddup_~j~1#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9) (and .cse0 .cse12 .cse1 (exists ((|v_ULTIMATE.start_mkdup_~j~0#1_24| Int) (|v_ULTIMATE.start_mkdup_~i~0#1_22| Int)) (and (<= |v_ULTIMATE.start_mkdup_~i~0#1_22| 2) (= .cse13 (let ((.cse16 (* |v_ULTIMATE.start_mkdup_~j~0#1_24| 4))) (let ((.cse15 (select .cse13 .cse16))) (store (store .cse14 (* |v_ULTIMATE.start_mkdup_~i~0#1_22| 4) .cse15) .cse16 .cse15)))) (<= 0 |v_ULTIMATE.start_mkdup_~i~0#1_22|))) .cse3 .cse4 .cse10 .cse5 (<= 3 |ULTIMATE.start_finddup_~n#1|) (= |ULTIMATE.start_finddup_~i~1#1| 1) .cse7 .cse11 .cse8 .cse9) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 (<= 1 |ULTIMATE.start_finddup_~j~1#1|) .cse5 .cse6 .cse7 .cse11 .cse8 .cse9))))) [2023-11-22 18:45:37,236 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-22 18:45:37,236 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse2 (select |#memory_int#2| |ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select (select |#memory_int#1| |ULTIMATE.start_main_~#j~2#1.base|) |ULTIMATE.start_main_~#j~2#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (not (= |ULTIMATE.start_main_#t~mem22#1| |ULTIMATE.start_main_#t~mem21#1|))) (.cse3 (select (select |#memory_int#3| |ULTIMATE.start_main_~#i~2#1.base|) |ULTIMATE.start_main_~#i~2#1.offset|)) (.cse5 (<= 1 |ULTIMATE.start_main_~n~0#1|)) (.cse4 (select .cse2 (* .cse6 4)))) (or (and .cse0 .cse1 (= (select .cse2 (* 4 .cse3)) .cse4) .cse5 (<= (+ 1 .cse3) .cse6) (<= 1 .cse3)) (and (<= 1 .cse6) .cse0 .cse1 (= 0 .cse3) .cse5 (= .cse4 (select .cse2 0)))))) [2023-11-22 18:45:37,236 INFO L899 garLoopResultBuilder]: For program point L62-1(line 62) no Hoare annotation was computed. [2023-11-22 18:45:37,236 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2023-11-22 18:45:37,236 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-22 18:45:37,236 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2023-11-22 18:45:37,236 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse2 (select |#memory_int#2| |ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select (select |#memory_int#1| |ULTIMATE.start_main_~#j~2#1.base|) |ULTIMATE.start_main_~#j~2#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_main_#t~mem26#1| |ULTIMATE.start_main_#t~mem25#1|)) (.cse3 (select (select |#memory_int#3| |ULTIMATE.start_main_~#i~2#1.base|) |ULTIMATE.start_main_~#i~2#1.offset|)) (.cse5 (<= 1 |ULTIMATE.start_main_~n~0#1|)) (.cse4 (select .cse2 (* .cse6 4)))) (or (and .cse0 .cse1 (= (select .cse2 (* 4 .cse3)) .cse4) .cse5 (<= (+ 1 .cse3) .cse6) (<= 1 .cse3)) (and (<= 1 .cse6) .cse0 .cse1 (= 0 .cse3) .cse5 (= .cse4 (select .cse2 0)))))) [2023-11-22 18:45:37,236 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2023-11-22 18:45:37,236 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (let ((.cse2 (select |#memory_int#2| |ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (select (select |#memory_int#1| |ULTIMATE.start_main_~#j~2#1.base|) |ULTIMATE.start_main_~#j~2#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_finddup_#res#1| 1)) (.cse3 (select (select |#memory_int#3| |ULTIMATE.start_main_~#i~2#1.base|) |ULTIMATE.start_main_~#i~2#1.offset|)) (.cse5 (<= (+ .cse7 1) |ULTIMATE.start_main_~n~0#1|)) (.cse6 (= |ULTIMATE.start_main_~r~0#1| 1)) (.cse4 (select .cse2 (* .cse7 4)))) (or (and .cse0 .cse1 (= (select .cse2 (* 4 .cse3)) .cse4) .cse5 .cse6 (<= (+ 1 .cse3) .cse7) (<= 1 .cse3)) (and (<= 1 .cse7) .cse0 .cse1 (= 0 .cse3) .cse5 .cse6 (= .cse4 (select .cse2 0)))))) [2023-11-22 18:45:37,237 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-11-22 18:45:37,237 INFO L902 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: true [2023-11-22 18:45:37,237 INFO L899 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2023-11-22 18:45:37,237 INFO L899 garLoopResultBuilder]: For program point finddup_returnLabel#1(lines 33 46) no Hoare annotation was computed. [2023-11-22 18:45:37,237 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2023-11-22 18:45:37,237 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 11) no Hoare annotation was computed. [2023-11-22 18:45:37,237 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 11) the Hoare annotation is: true [2023-11-22 18:45:37,237 INFO L899 garLoopResultBuilder]: For program point L10-1(line 10) no Hoare annotation was computed. [2023-11-22 18:45:37,237 INFO L899 garLoopResultBuilder]: For program point L10-3(lines 9 11) no Hoare annotation was computed. [2023-11-22 18:45:37,237 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2023-11-22 18:45:37,240 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:37,242 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 18:45:37,247 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:480) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:47) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-22 18:45:37,257 INFO L158 Benchmark]: Toolchain (without parser) took 50699.04ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 155.9MB in the beginning and 142.0MB in the end (delta: 13.9MB). Peak memory consumption was 235.3MB. Max. memory is 16.1GB. [2023-11-22 18:45:37,257 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 18:45:37,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.28ms. Allocated memory is still 184.5MB. Free memory was 155.9MB in the beginning and 144.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-22 18:45:37,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.97ms. Allocated memory is still 184.5MB. Free memory was 144.6MB in the beginning and 142.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 18:45:37,262 INFO L158 Benchmark]: Boogie Preprocessor took 63.49ms. Allocated memory is still 184.5MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 18:45:37,263 INFO L158 Benchmark]: RCFGBuilder took 501.75ms. Allocated memory is still 184.5MB. Free memory was 140.4MB in the beginning and 121.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-22 18:45:37,263 INFO L158 Benchmark]: TraceAbstraction took 49889.48ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 120.4MB in the beginning and 142.0MB in the end (delta: -21.6MB). Peak memory consumption was 199.7MB. Max. memory is 16.1GB. [2023-11-22 18:45:37,264 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.17ms. Allocated memory is still 142.6MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.28ms. Allocated memory is still 184.5MB. Free memory was 155.9MB in the beginning and 144.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.97ms. Allocated memory is still 184.5MB. Free memory was 144.6MB in the beginning and 142.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.49ms. Allocated memory is still 184.5MB. Free memory was 142.5MB in the beginning and 140.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 501.75ms. Allocated memory is still 184.5MB. Free memory was 140.4MB in the beginning and 121.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 49889.48ms. Allocated memory was 184.5MB in the beginning and 388.0MB in the end (delta: 203.4MB). Free memory was 120.4MB in the beginning and 142.0MB in the end (delta: -21.6MB). Peak memory consumption was 199.7MB. 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 - PositiveResult [Line: 10]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.8s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 384 SdHoareTripleChecker+Valid, 18.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 4064 SdHoareTripleChecker+Invalid, 17.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3458 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3162 IncrementalHoareTripleChecker+Invalid, 3251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 606 mSDtfsCounter, 3162 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1063 GetRequests, 749 SyntacticMatches, 26 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1910 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=12, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 73 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 92 PreInvPairs, 120 NumberOfFragments, 1142 HoareAnnotationTreeSize, 92 FomulaSimplifications, 4391 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 3575 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 1139 NumberOfCodeBlocks, 1139 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1371 ConstructedInterpolants, 100 QuantifiedInterpolants, 17826 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1704 ConjunctsInSsa, 271 ConjunctsInUnsatCore, 32 InterpolantComputations, 11 PerfectInterpolantSequences, 1083/1206 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:264) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-22 18:45:37,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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 ../../../trunk/examples/svcomp/verifythis/duplets.c -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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 18:45:39,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:45:39,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 18:45:39,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:45:39,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:45:39,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:45:39,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:45:39,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:45:39,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:45:39,601 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:45:39,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:45:39,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:45:39,602 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:45:39,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:45:39,602 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:45:39,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:45:39,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:45:39,606 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:45:39,606 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:45:39,606 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:45:39,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:45:39,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:45:39,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:45:39,608 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 18:45:39,608 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 18:45:39,609 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 18:45:39,609 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:45:39,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:45:39,609 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:45:39,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:45:39,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:45:39,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:45:39,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:45:39,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:45:39,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:45:39,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:45:39,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:45:39,613 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 18:45:39,613 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 18:45:39,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:45:39,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:45:39,614 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:45:39,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:45:39,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:45:39,615 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 18:45:39,615 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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2023-11-22 18:45:39,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:45:39,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:45:39,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:45:39,981 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:45:39,981 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:45:39,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/duplets.c [2023-11-22 18:45:41,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:45:41,652 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:45:41,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c [2023-11-22 18:45:41,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4f419f1/437728ac6d214645bf2aaaf8ac93015e/FLAGb71a2e028 [2023-11-22 18:45:41,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf4f419f1/437728ac6d214645bf2aaaf8ac93015e [2023-11-22 18:45:41,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:45:41,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:45:41,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:45:41,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:45:41,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:45:41,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:41,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9f2217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41, skipping insertion in model container [2023-11-22 18:45:41,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:41,717 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:45:41,847 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2023-11-22 18:45:41,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:45:41,901 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:45:41,914 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2023-11-22 18:45:41,942 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:45:41,965 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:45:41,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41 WrapperNode [2023-11-22 18:45:41,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:45:41,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:45:41,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:45:41,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:45:41,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:41,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:42,029 INFO L138 Inliner]: procedures = 23, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2023-11-22 18:45:42,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:45:42,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:45:42,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:45:42,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:45:42,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:42,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:42,057 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:42,079 INFO L189 HeapSplitter]: Split 18 memory accesses to 4 slices as follows [2, 6, 5, 5] [2023-11-22 18:45:42,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:42,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:42,093 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:42,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:42,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:42,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:42,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:45:42,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:45:42,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:45:42,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:45:42,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (1/1) ... [2023-11-22 18:45:42,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:45:42,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:45:42,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 18:45:42,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 18:45:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:45:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-22 18:45:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-22 18:45:42,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-22 18:45:42,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-22 18:45:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-22 18:45:42,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-22 18:45:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 18:45:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-22 18:45:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-22 18:45:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-22 18:45:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-22 18:45:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-22 18:45:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:45:42,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:45:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-22 18:45:42,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-22 18:45:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 18:45:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-22 18:45:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-22 18:45:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-22 18:45:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-22 18:45:42,328 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:45:42,329 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:45:42,586 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:45:42,656 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:45:42,664 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 18:45:42,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:45:42 BoogieIcfgContainer [2023-11-22 18:45:42,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:45:42,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:45:42,667 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:45:42,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:45:42,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:45:41" (1/3) ... [2023-11-22 18:45:42,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a93ef11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:45:42, skipping insertion in model container [2023-11-22 18:45:42,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:41" (2/3) ... [2023-11-22 18:45:42,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a93ef11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:45:42, skipping insertion in model container [2023-11-22 18:45:42,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:45:42" (3/3) ... [2023-11-22 18:45:42,673 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2023-11-22 18:45:42,690 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:45:42,690 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:45:42,734 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:45:42,739 INFO L357 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, mHoare=true, 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;@5e64cb66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:45:42,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:45:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 18:45:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 18:45:42,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:42,751 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:42,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:42,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash -633346845, now seen corresponding path program 1 times [2023-11-22 18:45:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:45:42,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778077318] [2023-11-22 18:45:42,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:42,772 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 [2023-11-22 18:45:42,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:45:42,778 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) [2023-11-22 18:45:42,783 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 [2023-11-22 18:45:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:42,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 18:45:42,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:45:42,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:45:42,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:45:42,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778077318] [2023-11-22 18:45:42,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778077318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:42,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:42,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:45:42,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326178139] [2023-11-22 18:45:42,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:42,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 18:45:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:45:43,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 18:45:43,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:45:43,014 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-22 18:45:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:43,058 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2023-11-22 18:45:43,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 18:45:43,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2023-11-22 18:45:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:43,067 INFO L225 Difference]: With dead ends: 70 [2023-11-22 18:45:43,067 INFO L226 Difference]: Without dead ends: 34 [2023-11-22 18:45:43,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:45:43,076 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:43,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:45:43,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-22 18:45:43,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-22 18:45:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 18:45:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-11-22 18:45:43,115 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 30 [2023-11-22 18:45:43,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:43,118 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-22 18:45:43,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-22 18:45:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2023-11-22 18:45:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-22 18:45:43,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:43,121 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:43,128 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 (2)] Forceful destruction successful, exit code 0 [2023-11-22 18:45:43,323 WARN L477 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 [2023-11-22 18:45:43,324 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:43,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1840136240, now seen corresponding path program 1 times [2023-11-22 18:45:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:45:43,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427275674] [2023-11-22 18:45:43,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:43,325 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 [2023-11-22 18:45:43,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:45:43,327 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) [2023-11-22 18:45:43,344 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 [2023-11-22 18:45:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:43,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-22 18:45:43,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:45:43,870 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:45:43,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:45:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427275674] [2023-11-22 18:45:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427275674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:43,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:43,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-22 18:45:43,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333375604] [2023-11-22 18:45:43,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:43,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 18:45:43,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:45:43,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 18:45:43,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-22 18:45:43,874 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 18:45:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:44,286 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2023-11-22 18:45:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 18:45:44,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 30 [2023-11-22 18:45:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:44,288 INFO L225 Difference]: With dead ends: 58 [2023-11-22 18:45:44,288 INFO L226 Difference]: Without dead ends: 39 [2023-11-22 18:45:44,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-11-22 18:45:44,290 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 57 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:44,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 145 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 18:45:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-22 18:45:44,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-11-22 18:45:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-22 18:45:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-11-22 18:45:44,299 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 30 [2023-11-22 18:45:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:44,300 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-11-22 18:45:44,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 18:45:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-11-22 18:45:44,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-22 18:45:44,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:44,306 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:44,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 18:45:44,509 WARN L477 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 [2023-11-22 18:45:44,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:44,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:44,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1407409120, now seen corresponding path program 1 times [2023-11-22 18:45:44,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:45:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170381264] [2023-11-22 18:45:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:44,511 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 [2023-11-22 18:45:44,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:45:44,512 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) [2023-11-22 18:45:44,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 (4)] Waiting until timeout for monitored process [2023-11-22 18:45:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:44,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 18:45:44,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:45:44,643 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:45:44,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:45:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170381264] [2023-11-22 18:45:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170381264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:44,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:44,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 18:45:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620501907] [2023-11-22 18:45:44,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:44,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 18:45:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:45:44,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 18:45:44,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:45:44,647 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-22 18:45:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:44,792 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2023-11-22 18:45:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 18:45:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2023-11-22 18:45:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:44,795 INFO L225 Difference]: With dead ends: 53 [2023-11-22 18:45:44,795 INFO L226 Difference]: Without dead ends: 51 [2023-11-22 18:45:44,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-22 18:45:44,797 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:44,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 180 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:45:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-22 18:45:44,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2023-11-22 18:45:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 18:45:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2023-11-22 18:45:44,808 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 31 [2023-11-22 18:45:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:44,809 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-22 18:45:44,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-22 18:45:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2023-11-22 18:45:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-22 18:45:44,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:44,810 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:44,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-22 18:45:45,013 WARN L477 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 [2023-11-22 18:45:45,014 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:45,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:45,015 INFO L85 PathProgramCache]: Analyzing trace with hash 449686045, now seen corresponding path program 1 times [2023-11-22 18:45:45,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:45:45,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447327551] [2023-11-22 18:45:45,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:45,016 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 [2023-11-22 18:45:45,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:45:45,017 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) [2023-11-22 18:45:45,022 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 [2023-11-22 18:45:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:45,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-22 18:45:45,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:45,507 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:45:45,508 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:45:45,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:45:45,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447327551] [2023-11-22 18:45:45,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447327551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:45,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:45,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-22 18:45:45,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599362830] [2023-11-22 18:45:45,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:45,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-22 18:45:45,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:45:45,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-22 18:45:45,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-11-22 18:45:45,513 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 18:45:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:46,044 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2023-11-22 18:45:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 18:45:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2023-11-22 18:45:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:46,048 INFO L225 Difference]: With dead ends: 77 [2023-11-22 18:45:46,048 INFO L226 Difference]: Without dead ends: 48 [2023-11-22 18:45:46,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-11-22 18:45:46,050 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:46,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 236 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 18:45:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-22 18:45:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2023-11-22 18:45:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 30 states have internal predecessors, (34), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 18:45:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2023-11-22 18:45:46,059 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 33 [2023-11-22 18:45:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:46,060 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-11-22 18:45:46,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 18:45:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2023-11-22 18:45:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 18:45:46,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:46,061 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:46,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-22 18:45:46,264 WARN L477 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 [2023-11-22 18:45:46,264 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:46,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash -320162031, now seen corresponding path program 1 times [2023-11-22 18:45:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:45:46,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064908722] [2023-11-22 18:45:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:46,265 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 [2023-11-22 18:45:46,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:45:46,266 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) [2023-11-22 18:45:46,267 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 [2023-11-22 18:45:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:46,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-22 18:45:46,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:45:46,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:45:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:45:46,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:45:46,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064908722] [2023-11-22 18:45:46,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064908722] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:45:46,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:45:46,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2023-11-22 18:45:46,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172558463] [2023-11-22 18:45:46,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:45:46,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-22 18:45:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:45:46,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-22 18:45:46,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-11-22 18:45:46,774 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-22 18:45:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:47,647 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2023-11-22 18:45:47,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-22 18:45:47,650 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 35 [2023-11-22 18:45:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:47,652 INFO L225 Difference]: With dead ends: 99 [2023-11-22 18:45:47,652 INFO L226 Difference]: Without dead ends: 70 [2023-11-22 18:45:47,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=821, Unknown=0, NotChecked=0, Total=1056 [2023-11-22 18:45:47,654 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 125 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:47,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 256 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 18:45:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-22 18:45:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2023-11-22 18:45:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 44 states have internal predecessors, (57), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-22 18:45:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2023-11-22 18:45:47,675 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 76 transitions. Word has length 35 [2023-11-22 18:45:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:47,676 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 76 transitions. [2023-11-22 18:45:47,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-22 18:45:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 76 transitions. [2023-11-22 18:45:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 18:45:47,677 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:47,677 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:47,685 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 [2023-11-22 18:45:47,880 WARN L477 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 [2023-11-22 18:45:47,881 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:47,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash 9167953, now seen corresponding path program 1 times [2023-11-22 18:45:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:45:47,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206274223] [2023-11-22 18:45:47,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:47,882 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 [2023-11-22 18:45:47,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:45:47,883 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) [2023-11-22 18:45:47,884 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 [2023-11-22 18:45:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:47,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-22 18:45:47,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:48,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:45:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:45:48,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:45:48,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-22 18:45:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:45:48,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:45:48,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206274223] [2023-11-22 18:45:48,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206274223] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-22 18:45:48,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:45:48,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2023-11-22 18:45:48,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748187702] [2023-11-22 18:45:48,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:48,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 18:45:48,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:45:48,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 18:45:48,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-11-22 18:45:48,645 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-22 18:45:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:49,058 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2023-11-22 18:45:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 18:45:49,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-22 18:45:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:49,061 INFO L225 Difference]: With dead ends: 77 [2023-11-22 18:45:49,061 INFO L226 Difference]: Without dead ends: 75 [2023-11-22 18:45:49,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-11-22 18:45:49,063 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:49,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 204 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 18:45:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-22 18:45:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2023-11-22 18:45:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 51 states have internal predecessors, (64), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-22 18:45:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2023-11-22 18:45:49,087 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 38 [2023-11-22 18:45:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:49,087 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2023-11-22 18:45:49,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-22 18:45:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2023-11-22 18:45:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 18:45:49,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:49,089 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:49,095 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 (7)] Forceful destruction successful, exit code 0 [2023-11-22 18:45:49,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:45:49,292 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:49,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash 11014995, now seen corresponding path program 1 times [2023-11-22 18:45:49,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:45:49,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619512677] [2023-11-22 18:45:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:49,293 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 [2023-11-22 18:45:49,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:45:49,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:45:49,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-22 18:45:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:49,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 18:45:49,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:49,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:45:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:45:49,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:45:49,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:45:49,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619512677] [2023-11-22 18:45:49,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619512677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:49,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:49,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 18:45:49,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587064284] [2023-11-22 18:45:49,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:49,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 18:45:49,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:45:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 18:45:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:45:49,464 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-22 18:45:51,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:45:53,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:45:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:53,634 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2023-11-22 18:45:53,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 18:45:53,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-22 18:45:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:53,636 INFO L225 Difference]: With dead ends: 97 [2023-11-22 18:45:53,636 INFO L226 Difference]: Without dead ends: 83 [2023-11-22 18:45:53,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-22 18:45:53,637 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:53,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 152 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2023-11-22 18:45:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-22 18:45:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2023-11-22 18:45:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.293103448275862) internal successors, (75), 61 states have internal predecessors, (75), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-22 18:45:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 103 transitions. [2023-11-22 18:45:53,650 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 103 transitions. Word has length 38 [2023-11-22 18:45:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:53,651 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 103 transitions. [2023-11-22 18:45:53,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-22 18:45:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 103 transitions. [2023-11-22 18:45:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-22 18:45:53,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:53,652 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:53,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-22 18:45:53,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 18:45:53,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:53,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:53,857 INFO L85 PathProgramCache]: Analyzing trace with hash 161144636, now seen corresponding path program 2 times [2023-11-22 18:45:53,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:45:53,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1056037008] [2023-11-22 18:45:53,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 18:45:53,857 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 [2023-11-22 18:45:53,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:45:53,859 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:45:53,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-22 18:45:54,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 18:45:54,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:45:54,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-22 18:45:54,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:54,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:45:54,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 15 [2023-11-22 18:45:54,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-22 18:45:54,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:45:54,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 50 [2023-11-22 18:45:56,242 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:45:56,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:45:56,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:45:56,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 385 treesize of output 345 [2023-11-22 18:45:57,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:45:57,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1056037008] [2023-11-22 18:45:57,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1056037008] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:45:57,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [389302483] [2023-11-22 18:45:57,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 18:45:57,646 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-22 18:45:57,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-11-22 18:45:57,647 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-22 18:45:57,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-11-22 18:45:57,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 18:45:57,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:45:57,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-22 18:45:57,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:45:58,249 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2023-11-22 18:45:58,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 15 [2023-11-22 18:45:58,776 INFO L349 Elim1Store]: treesize reduction 12, result has 77.4 percent of original size [2023-11-22 18:45:58,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 50 [2023-11-22 18:45:59,615 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-22 18:45:59,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:46:00,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:46:00,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 409 treesize of output 369 [2023-11-22 18:46:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [389302483] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:46:00,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:46:00,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2023-11-22 18:46:00,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094837397] [2023-11-22 18:46:00,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:46:00,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-22 18:46:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:46:00,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-22 18:46:00,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2023-11-22 18:46:00,568 INFO L87 Difference]: Start difference. First operand 80 states and 103 transitions. Second operand has 23 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-22 18:46:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:46:03,803 INFO L93 Difference]: Finished difference Result 138 states and 184 transitions. [2023-11-22 18:46:03,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-22 18:46:03,804 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 38 [2023-11-22 18:46:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:46:03,804 INFO L225 Difference]: With dead ends: 138 [2023-11-22 18:46:03,804 INFO L226 Difference]: Without dead ends: 99 [2023-11-22 18:46:03,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=273, Invalid=1983, Unknown=0, NotChecked=0, Total=2256 [2023-11-22 18:46:03,806 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 90 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:46:03,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 432 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-22 18:46:03,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-22 18:46:03,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2023-11-22 18:46:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 61 states have internal predecessors, (74), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-22 18:46:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2023-11-22 18:46:03,821 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 38 [2023-11-22 18:46:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:46:03,822 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2023-11-22 18:46:03,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-11-22 18:46:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2023-11-22 18:46:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 18:46:03,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:46:03,823 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:46:03,830 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 (9)] Forceful destruction successful, exit code 0 [2023-11-22 18:46:04,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-11-22 18:46:04,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-11-22 18:46:04,226 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:46:04,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:46:04,227 INFO L85 PathProgramCache]: Analyzing trace with hash 956566272, now seen corresponding path program 1 times [2023-11-22 18:46:04,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:46:04,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159069612] [2023-11-22 18:46:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:46:04,227 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 [2023-11-22 18:46:04,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:46:04,228 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 18:46:04,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-22 18:46:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:46:04,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-22 18:46:04,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:46:04,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:46:04,630 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-22 18:46:04,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:46:04,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-22 18:46:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 18:46:04,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:46:04,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159069612] [2023-11-22 18:46:04,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159069612] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-22 18:46:04,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:46:04,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2023-11-22 18:46:04,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210392591] [2023-11-22 18:46:04,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:46:04,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 18:46:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:46:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 18:46:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-11-22 18:46:04,873 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 18:46:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:46:05,298 INFO L93 Difference]: Finished difference Result 100 states and 127 transitions. [2023-11-22 18:46:05,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 18:46:05,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-22 18:46:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:46:05,299 INFO L225 Difference]: With dead ends: 100 [2023-11-22 18:46:05,299 INFO L226 Difference]: Without dead ends: 98 [2023-11-22 18:46:05,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2023-11-22 18:46:05,300 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:46:05,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 186 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 18:46:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-22 18:46:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2023-11-22 18:46:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 70 states have internal predecessors, (83), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-22 18:46:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 117 transitions. [2023-11-22 18:46:05,317 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 117 transitions. Word has length 45 [2023-11-22 18:46:05,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:46:05,317 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 117 transitions. [2023-11-22 18:46:05,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 18:46:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions. [2023-11-22 18:46:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 18:46:05,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:46:05,319 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:46:05,325 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 (11)] Forceful destruction successful, exit code 0 [2023-11-22 18:46:05,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 [2023-11-22 18:46:05,522 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:46:05,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:46:05,523 INFO L85 PathProgramCache]: Analyzing trace with hash 958413314, now seen corresponding path program 1 times [2023-11-22 18:46:05,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:46:05,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129618296] [2023-11-22 18:46:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:46:05,524 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 [2023-11-22 18:46:05,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:46:05,524 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2023-11-22 18:46:05,525 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 (12)] Waiting until timeout for monitored process [2023-11-22 18:46:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:46:05,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 18:46:05,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:46:05,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:46:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 18:46:05,703 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:46:05,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:46:05,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129618296] [2023-11-22 18:46:05,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129618296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:46:05,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:46:05,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 18:46:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473213633] [2023-11-22 18:46:05,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:46:05,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 18:46:05,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:46:05,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 18:46:05,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:46:05,704 INFO L87 Difference]: Start difference. First operand 92 states and 117 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 18:46:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:46:05,872 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2023-11-22 18:46:05,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 18:46:05,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-11-22 18:46:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:46:05,873 INFO L225 Difference]: With dead ends: 121 [2023-11-22 18:46:05,873 INFO L226 Difference]: Without dead ends: 110 [2023-11-22 18:46:05,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-22 18:46:05,874 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:46:05,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:46:05,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-22 18:46:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-22 18:46:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 81 states have internal predecessors, (94), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-22 18:46:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2023-11-22 18:46:05,893 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 45 [2023-11-22 18:46:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:46:05,894 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2023-11-22 18:46:05,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-22 18:46:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2023-11-22 18:46:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 18:46:05,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:46:05,900 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:46:05,904 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 (12)] Forceful destruction successful, exit code 0 [2023-11-22 18:46:06,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 [2023-11-22 18:46:06,103 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:46:06,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:46:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash 601257606, now seen corresponding path program 1 times [2023-11-22 18:46:06,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:46:06,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756016253] [2023-11-22 18:46:06,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:46:06,104 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 [2023-11-22 18:46:06,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:46:06,104 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2023-11-22 18:46:06,105 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 (13)] Waiting until timeout for monitored process [2023-11-22 18:46:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:46:06,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-22 18:46:06,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:46:06,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:46:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:46:06,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:46:06,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-22 18:46:07,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 18:46:07,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:46:07,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756016253] [2023-11-22 18:46:07,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756016253] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:46:07,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:46:07,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2023-11-22 18:46:07,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062944552] [2023-11-22 18:46:07,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:46:07,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-22 18:46:07,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:46:07,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-22 18:46:07,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2023-11-22 18:46:07,366 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 27 states have internal predecessors, (48), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-22 18:46:09,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:46:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:46:13,325 INFO L93 Difference]: Finished difference Result 194 states and 245 transitions. [2023-11-22 18:46:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-22 18:46:13,325 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 27 states have internal predecessors, (48), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 45 [2023-11-22 18:46:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:46:13,326 INFO L225 Difference]: With dead ends: 194 [2023-11-22 18:46:13,326 INFO L226 Difference]: Without dead ends: 180 [2023-11-22 18:46:13,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=713, Invalid=3069, Unknown=0, NotChecked=0, Total=3782 [2023-11-22 18:46:13,329 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 144 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:46:13,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 594 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 842 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2023-11-22 18:46:13,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-22 18:46:13,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 135. [2023-11-22 18:46:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 101 states have (on average 1.306930693069307) internal successors, (132), 106 states have internal predecessors, (132), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-22 18:46:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 173 transitions. [2023-11-22 18:46:13,353 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 173 transitions. Word has length 45 [2023-11-22 18:46:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:46:13,353 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 173 transitions. [2023-11-22 18:46:13,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 27 states have internal predecessors, (48), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-22 18:46:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 173 transitions. [2023-11-22 18:46:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-22 18:46:13,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:46:13,355 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:46:13,360 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 (13)] Forceful destruction successful, exit code 0 [2023-11-22 18:46:13,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 [2023-11-22 18:46:13,558 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:46:13,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:46:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash 753234289, now seen corresponding path program 3 times [2023-11-22 18:46:13,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:46:13,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221653816] [2023-11-22 18:46:13,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 18:46:13,559 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 [2023-11-22 18:46:13,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:46:13,560 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2023-11-22 18:46:13,562 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 (14)] Waiting until timeout for monitored process [2023-11-22 18:46:13,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-22 18:46:13,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:46:13,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-22 18:46:13,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:46:13,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-22 18:46:15,727 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_9|))) is different from true [2023-11-22 18:46:17,757 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_10| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_10|))) is different from true [2023-11-22 18:46:19,785 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_11| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_11|))) is different from true [2023-11-22 18:46:19,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2023-11-22 18:46:20,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2023-11-22 18:46:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 12 not checked. [2023-11-22 18:46:20,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:46:21,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:46:21,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221653816] [2023-11-22 18:46:21,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221653816] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:46:21,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1210311691] [2023-11-22 18:46:21,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 18:46:21,618 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-22 18:46:21,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-11-22 18:46:21,619 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-22 18:46:21,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-11-22 18:46:21,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-22 18:46:21,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:46:21,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-22 18:46:21,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:46:22,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-11-22 18:46:24,145 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))) is different from true [2023-11-22 18:46:30,502 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_13| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))))) is different from true [2023-11-22 18:46:34,790 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_14| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_14|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))))) is different from true [2023-11-22 18:46:37,182 INFO L349 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2023-11-22 18:46:37,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 45 [2023-11-22 18:46:39,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2023-11-22 18:46:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2023-11-22 18:46:39,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:46:49,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1210311691] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:46:49,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:46:49,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24] total 37 [2023-11-22 18:46:49,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763991617] [2023-11-22 18:46:49,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:46:49,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-22 18:46:49,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:46:49,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-22 18:46:49,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=2853, Unknown=9, NotChecked=702, Total=4032 [2023-11-22 18:46:49,846 INFO L87 Difference]: Start difference. First operand 135 states and 173 transitions. Second operand has 37 states, 34 states have (on average 1.588235294117647) internal successors, (54), 30 states have internal predecessors, (54), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-22 18:46:51,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:46:53,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:46:55,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:47:02,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:47:04,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:47:06,197 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_9| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_9|))))) is different from true [2023-11-22 18:47:12,411 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_13| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_13|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_10| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_10|))))) is different from true [2023-11-22 18:47:16,643 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) (and (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_14| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_14|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_12|))) (exists ((|v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_11| (_ BitVec 32))) (= .cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_mkdup_~a#1.base_BEFORE_CALL_11|))))) is different from true [2023-11-22 18:47:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:47:23,722 INFO L93 Difference]: Finished difference Result 197 states and 243 transitions. [2023-11-22 18:47:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-22 18:47:23,723 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 1.588235294117647) internal successors, (54), 30 states have internal predecessors, (54), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 45 [2023-11-22 18:47:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:47:23,725 INFO L225 Difference]: With dead ends: 197 [2023-11-22 18:47:23,725 INFO L226 Difference]: Without dead ends: 116 [2023-11-22 18:47:23,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 83 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 1908 ImplicationChecksByTransitivity, 56.5s TimeCoverageRelationStatistics Valid=849, Invalid=4872, Unknown=15, NotChecked=1404, Total=7140 [2023-11-22 18:47:23,727 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 78 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 490 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2023-11-22 18:47:23,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 318 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 434 Invalid, 5 Unknown, 490 Unchecked, 11.5s Time] [2023-11-22 18:47:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-22 18:47:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2023-11-22 18:47:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 81 states have internal predecessors, (88), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-22 18:47:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2023-11-22 18:47:23,750 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 45 [2023-11-22 18:47:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:47:23,750 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2023-11-22 18:47:23,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 1.588235294117647) internal successors, (54), 30 states have internal predecessors, (54), 6 states have call successors, (8), 8 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-22 18:47:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2023-11-22 18:47:23,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-22 18:47:23,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:47:23,751 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:47:23,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2023-11-22 18:47:23,957 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 (14)] Forceful destruction successful, exit code 0 [2023-11-22 18:47:24,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /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 [2023-11-22 18:47:24,154 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:47:24,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:47:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1087457780, now seen corresponding path program 1 times [2023-11-22 18:47:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:47:24,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342180583] [2023-11-22 18:47:24,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:47:24,155 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 [2023-11-22 18:47:24,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:47:24,157 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2023-11-22 18:47:24,157 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 (16)] Waiting until timeout for monitored process [2023-11-22 18:47:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:24,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-22 18:47:24,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:47:24,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:47:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-22 18:47:24,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:47:24,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-22 18:47:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 18:47:25,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:47:25,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342180583] [2023-11-22 18:47:25,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342180583] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:47:25,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:47:25,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2023-11-22 18:47:25,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708237353] [2023-11-22 18:47:25,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:47:25,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-22 18:47:25,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:47:25,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-22 18:47:25,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-11-22 18:47:25,186 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-22 18:47:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:47:26,701 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2023-11-22 18:47:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-22 18:47:26,702 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 47 [2023-11-22 18:47:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:47:26,703 INFO L225 Difference]: With dead ends: 169 [2023-11-22 18:47:26,703 INFO L226 Difference]: Without dead ends: 158 [2023-11-22 18:47:26,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=263, Invalid=1377, Unknown=0, NotChecked=0, Total=1640 [2023-11-22 18:47:26,704 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 79 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-22 18:47:26,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 377 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-22 18:47:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-22 18:47:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 122. [2023-11-22 18:47:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.1411764705882352) internal successors, (97), 90 states have internal predecessors, (97), 23 states have call successors, (23), 13 states have call predecessors, (23), 13 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-22 18:47:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2023-11-22 18:47:26,733 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 47 [2023-11-22 18:47:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:47:26,734 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2023-11-22 18:47:26,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-22 18:47:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2023-11-22 18:47:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-22 18:47:26,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:47:26,735 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:47:26,738 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 (16)] Forceful destruction successful, exit code 0 [2023-11-22 18:47:26,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 [2023-11-22 18:47:26,939 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:47:26,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:47:26,939 INFO L85 PathProgramCache]: Analyzing trace with hash 733996156, now seen corresponding path program 1 times [2023-11-22 18:47:26,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:47:26,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11425546] [2023-11-22 18:47:26,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:47:26,939 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 [2023-11-22 18:47:26,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:47:26,940 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2023-11-22 18:47:26,941 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 (17)] Waiting until timeout for monitored process [2023-11-22 18:47:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:27,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 18:47:27,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:47:27,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:47:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 18:47:27,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:47:27,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-22 18:47:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 18:47:27,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:47:27,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11425546] [2023-11-22 18:47:27,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11425546] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:47:27,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:47:27,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2023-11-22 18:47:27,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855889563] [2023-11-22 18:47:27,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:47:27,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 18:47:27,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:47:27,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 18:47:27,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-22 18:47:27,356 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-22 18:47:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:47:27,703 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2023-11-22 18:47:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-22 18:47:27,703 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2023-11-22 18:47:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:47:27,704 INFO L225 Difference]: With dead ends: 154 [2023-11-22 18:47:27,704 INFO L226 Difference]: Without dead ends: 140 [2023-11-22 18:47:27,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-11-22 18:47:27,705 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:47:27,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 304 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 18:47:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-22 18:47:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2023-11-22 18:47:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 73 states have internal predecessors, (78), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-22 18:47:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2023-11-22 18:47:27,726 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 47 [2023-11-22 18:47:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:47:27,726 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2023-11-22 18:47:27,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-22 18:47:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2023-11-22 18:47:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-22 18:47:27,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:47:27,727 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:47:27,733 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 (17)] Forceful destruction successful, exit code 0 [2023-11-22 18:47:27,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 [2023-11-22 18:47:27,931 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:47:27,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:47:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1972974870, now seen corresponding path program 1 times [2023-11-22 18:47:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:47:27,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31474091] [2023-11-22 18:47:27,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:47:27,931 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 [2023-11-22 18:47:27,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:47:27,933 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2023-11-22 18:47:27,938 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 (18)] Waiting until timeout for monitored process [2023-11-22 18:47:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:28,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-22 18:47:28,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:47:28,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:47:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 18:47:28,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:47:28,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-22 18:47:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 18:47:28,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:47:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31474091] [2023-11-22 18:47:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31474091] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:47:28,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:47:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-11-22 18:47:28,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718424973] [2023-11-22 18:47:28,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:47:28,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 18:47:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:47:28,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 18:47:28,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-11-22 18:47:28,377 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-22 18:47:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:47:29,134 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2023-11-22 18:47:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-22 18:47:29,135 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2023-11-22 18:47:29,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:47:29,136 INFO L225 Difference]: With dead ends: 158 [2023-11-22 18:47:29,136 INFO L226 Difference]: Without dead ends: 147 [2023-11-22 18:47:29,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2023-11-22 18:47:29,137 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 91 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 18:47:29,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 315 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 18:47:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-22 18:47:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 102. [2023-11-22 18:47:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.125) internal successors, (81), 75 states have internal predecessors, (81), 17 states have call successors, (17), 12 states have call predecessors, (17), 12 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-22 18:47:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2023-11-22 18:47:29,155 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 49 [2023-11-22 18:47:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:47:29,156 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2023-11-22 18:47:29,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-22 18:47:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2023-11-22 18:47:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-22 18:47:29,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:47:29,157 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:47:29,165 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 (18)] Ended with exit code 0 [2023-11-22 18:47:29,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 [2023-11-22 18:47:29,361 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:47:29,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:47:29,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1531281429, now seen corresponding path program 1 times [2023-11-22 18:47:29,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:47:29,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113285985] [2023-11-22 18:47:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:47:29,362 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 [2023-11-22 18:47:29,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:47:29,363 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2023-11-22 18:47:29,364 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 (19)] Waiting until timeout for monitored process [2023-11-22 18:47:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:29,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-22 18:47:29,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:47:29,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:47:29,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:47:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-22 18:47:29,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:47:29,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2023-11-22 18:47:29,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-11-22 18:47:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-22 18:47:29,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:47:29,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113285985] [2023-11-22 18:47:29,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113285985] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-22 18:47:29,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:47:29,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-11-22 18:47:29,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905894435] [2023-11-22 18:47:29,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:47:29,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 18:47:29,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:47:30,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 18:47:30,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-11-22 18:47:30,000 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-22 18:47:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:47:30,293 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2023-11-22 18:47:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 18:47:30,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2023-11-22 18:47:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:47:30,295 INFO L225 Difference]: With dead ends: 128 [2023-11-22 18:47:30,295 INFO L226 Difference]: Without dead ends: 126 [2023-11-22 18:47:30,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-11-22 18:47:30,296 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:47:30,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 180 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 18:47:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-22 18:47:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2023-11-22 18:47:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 89 states have internal predecessors, (94), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-22 18:47:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2023-11-22 18:47:30,315 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 51 [2023-11-22 18:47:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:47:30,315 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2023-11-22 18:47:30,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-22 18:47:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2023-11-22 18:47:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-22 18:47:30,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:47:30,316 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:47:30,320 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 (19)] Ended with exit code 0 [2023-11-22 18:47:30,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 [2023-11-22 18:47:30,520 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:47:30,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:47:30,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1682996437, now seen corresponding path program 1 times [2023-11-22 18:47:30,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:47:30,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139031973] [2023-11-22 18:47:30,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:47:30,521 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 [2023-11-22 18:47:30,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:47:30,522 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2023-11-22 18:47:30,525 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 (20)] Waiting until timeout for monitored process [2023-11-22 18:47:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:30,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-22 18:47:30,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:47:31,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:47:31,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:47:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:47:31,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:47:31,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-11-22 18:47:32,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-11-22 18:47:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 18:47:33,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:47:33,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139031973] [2023-11-22 18:47:33,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139031973] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:47:33,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:47:33,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 33 [2023-11-22 18:47:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72751154] [2023-11-22 18:47:33,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:47:33,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-22 18:47:33,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:47:33,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-22 18:47:33,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2023-11-22 18:47:33,208 INFO L87 Difference]: Start difference. First operand 122 states and 136 transitions. Second operand has 33 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 7 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-22 18:47:35,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-22 18:47:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:47:38,607 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2023-11-22 18:47:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-22 18:47:38,608 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 7 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 52 [2023-11-22 18:47:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:47:38,609 INFO L225 Difference]: With dead ends: 179 [2023-11-22 18:47:38,609 INFO L226 Difference]: Without dead ends: 162 [2023-11-22 18:47:38,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=410, Invalid=3012, Unknown=0, NotChecked=0, Total=3422 [2023-11-22 18:47:38,610 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 107 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-22 18:47:38,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 420 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 903 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2023-11-22 18:47:38,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-22 18:47:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 122. [2023-11-22 18:47:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.0813953488372092) internal successors, (93), 89 states have internal predecessors, (93), 21 states have call successors, (21), 15 states have call predecessors, (21), 14 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-22 18:47:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2023-11-22 18:47:38,637 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 52 [2023-11-22 18:47:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:47:38,638 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2023-11-22 18:47:38,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 7 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2023-11-22 18:47:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2023-11-22 18:47:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-22 18:47:38,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:47:38,640 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:47:38,645 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 (20)] Forceful destruction successful, exit code 0 [2023-11-22 18:47:38,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 [2023-11-22 18:47:38,844 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:47:38,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:47:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash 210876383, now seen corresponding path program 1 times [2023-11-22 18:47:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:47:38,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550030158] [2023-11-22 18:47:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:47:38,845 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 [2023-11-22 18:47:38,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:47:38,846 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2023-11-22 18:47:38,847 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 (21)] Waiting until timeout for monitored process [2023-11-22 18:47:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:38,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-22 18:47:38,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:47:39,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:47:39,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-22 18:47:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-22 18:47:39,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:47:39,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2023-11-22 18:47:39,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-11-22 18:47:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-22 18:47:39,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 18:47:39,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550030158] [2023-11-22 18:47:39,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550030158] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:47:39,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 18:47:39,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2023-11-22 18:47:39,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964032587] [2023-11-22 18:47:39,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 18:47:39,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-22 18:47:39,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 18:47:39,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-22 18:47:39,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-22 18:47:39,640 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 18:47:40,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:47:40,635 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2023-11-22 18:47:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-22 18:47:40,636 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 53 [2023-11-22 18:47:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:47:40,638 INFO L225 Difference]: With dead ends: 179 [2023-11-22 18:47:40,638 INFO L226 Difference]: Without dead ends: 175 [2023-11-22 18:47:40,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2023-11-22 18:47:40,639 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 48 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 18:47:40,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 329 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 18:47:40,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-22 18:47:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 124. [2023-11-22 18:47:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 88 states have (on average 1.1022727272727273) internal successors, (97), 91 states have internal predecessors, (97), 21 states have call successors, (21), 15 states have call predecessors, (21), 14 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2023-11-22 18:47:40,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2023-11-22 18:47:40,664 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 53 [2023-11-22 18:47:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:47:40,665 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2023-11-22 18:47:40,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 18:47:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2023-11-22 18:47:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-22 18:47:40,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:47:40,666 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:47:40,675 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 (21)] Forceful destruction successful, exit code 0 [2023-11-22 18:47:40,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 [2023-11-22 18:47:40,870 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:47:40,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:47:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash -710336108, now seen corresponding path program 1 times [2023-11-22 18:47:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 18:47:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518065251] [2023-11-22 18:47:40,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:47:40,871 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 [2023-11-22 18:47:40,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 18:47:40,872 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2023-11-22 18:47:40,872 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 (22)] Waiting until timeout for monitored process [2023-11-22 18:47:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:40,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-22 18:47:40,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:47:41,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 18:47:41,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-22 18:47:43,146 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15|))) (= (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22|) (_ bv4 32)))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31|))))))) is different from true [2023-11-22 18:47:47,316 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_32| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_23| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_16|))) (= (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_32|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_32|)))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_16| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_23|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_23|))))))) (exists ((|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31| (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15|))) (= (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22|) (_ bv4 32)))) (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31|)))))))) is different from true [2023-11-22 18:47:51,543 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15|))) (= (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22|) (_ bv4 32)))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31|))))))) (exists ((|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_33| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_24| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_24| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_33| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_17| (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_17|))) (= (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_17| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_24|)))) (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_17| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_33|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_33|)))))))) is different from true [2023-11-22 18:47:57,848 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_18| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_18|))) (= (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_18| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_25|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_25|)))) (select .cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_18| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_34|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_34|))))))) (exists ((|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_19| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_26| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_35| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_19| (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_19|))) (= (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_19| (bvmul (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_35|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_35|) (_ bv4 32)))) (select .cse1 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_19| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_26|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_26|))))))) (exists ((|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31| (_ BitVec 32))) (let ((.cse2 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_15|))) (= (select .cse2 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_22|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_22|) (_ bv4 32)))) (select .cse2 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_15| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_31|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_31|))))))) (exists ((|v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_33| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_24| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_24| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_33| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_17| (_ BitVec 32))) (let ((.cse3 (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_17|))) (= (select .cse3 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_17| (bvmul (_ bv4 32) (select (select |c_#memory_int#2| |v_ULTIMATE.start_main_~#i~2#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#i~2#1.offset_BEFORE_CALL_24|)))) (select .cse3 (bvadd |v_ULTIMATE.start_main_~a~0#1.offset_BEFORE_CALL_17| (bvmul (_ bv4 32) (select (select |c_#memory_int#3| |v_ULTIMATE.start_main_~#j~2#1.base_BEFORE_CALL_33|) |v_ULTIMATE.start_main_~#j~2#1.offset_BEFORE_CALL_33|)))))))) is different from true [2023-11-22 18:48:00,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:48:00,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 70 [2023-11-22 18:48:00,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-22 18:48:00,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 62 [2023-11-22 18:48:00,341 INFO L349 Elim1Store]: treesize reduction 24, result has 77.1 percent of original size [2023-11-22 18:48:00,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 93 [2023-11-22 18:48:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 32 not checked. [2023-11-22 18:48:00,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:48:00,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2023-11-22 18:48:00,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 130 Killed by 15